Data storage using peptides

ABSTRACT

Methods and systems for storing digital data into peptide sequences and retrieving digital data from peptide sequences are disclosed. The method for storing digital data into peptide sequences may include: encoding the digital data into a digital code; translating the digital code into the peptide sequences; and synthesizing the translated peptide sequences. The method for retrieving digital data from peptide sequences may include: sequencing and determining an order of the peptide sequences; converting the peptide sequences with the determined order into a digital code; and decoding the digital data from the digital code. Codes with error-correction capability are developed for encoding digital data into peptide sequences, and a computational method implemented in a software is developed for sequencing the digital data bearing peptides.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application claims the benefit of priority of U.S. Provisional Application No. 62/657,026, filed on Apr. 13, 2018, the contents of which being hereby incorporated by reference in their entirety for all purposes.

TECHNICAL FIELD

The present invention relates to data storage and retrieval, and more particularly, to methods and systems for data storage and retrieval using peptides.

BACKGROUND

With digital data being generated at an exponential rate, storage of digital data becomes particularly important to the growth of information technology. These digital data are represented by bits of 0 and 1 and stored in media, such as hard drives and magnetic tapes. Many of rarely accessed data have been archived on reels of magnetic tapes. The physical limitations in the thickness of tapes and the size of magnetic domains pose a limitation to the maximum data density, which is expected to reach a plateau soon. In order to store the huge amount of data generated, huge storage space in specially built data centres is needed. Furthermore, the magnetic tapes are rated to last for several decades only, and copying data from old tapes into new tapes from time to time is required, which is both time-consuming and expensive.

One of the emerging technologies to fulfil this need is storing digital data in DNA, where the set of monomers (nucleotides) with different side chains represents the different combinations of 0 and 1 in digital data. To retrieve the data, the DNA strands are sequenced, and the sequence information of the monomers is converted back to combinations of 0 and 1. However, DNA has only 4 natural nucleotides, and unnatural nucleotides may not be used for data storage since they cannot be recognized by the enzymes for DNA sequencing. In addition, DNA is prone to degradation which makes it challenging for long-term data storage.

Hence, what is needed is a method and system for storing and retrieving digital data that seeks to address one or more of the above-mentioned problems. Furthermore, other desirable features and characteristics will become apparent from the subsequent detailed description and the appended claims, taken in conjunction with the accompanying drawings and this background of the disclosure.

SUMMARY

According to a first aspect, there is provided a method of storing digital data into peptide sequences.

In one embodiment, the method of storing digital data into peptide sequences may comprise: encoding the digital data into a digital code: translating the digital code into the peptide sequences; and synthesizing the translated peptide sequences.

In one embodiment, the translating of the digital code into peptide sequences may comprise mapping a bit pattern or a symbol pattern into one or more amino acids such that the digital code is represented by a sequence of amino acids in the peptide sequences.

In one embodiment, the method of storing digital data into peptide sequences may further comprise forming a mixture of peptides based on the translated peptide sequences.

In one embodiment, the method of storing digital data into peptide sequences may further comprise adding one or more order-checking bits into the digital code, wherein the one or more order-checking bits may be related to the order of the bits or symbols in the digital code.

In one embodiment, the method of storing digital data into peptide sequences may further comprise adding one or more error-correction codes into the digital code, wherein the one or more error-correction codes may comprise any one or combination of repetition code, convolutional code, turbo code, fountain code, low-density parity-check (LDPC) code, Reed-Solomon (RS) code, Hadamard code, and Hamming code.

In one embodiment, the one or more error-correction codes may be generated based on the digital code, or both the digital code and order-checking bits added into the digital code.

In one embodiment; the peptide sequences may comprise distinct functional groups; isotope labels or affinity labels.

In one embodiment; the peptide sequences may comprise digital data bearing amino acids and non-digital data bearing amino acids.

According to a second aspect, there is provided a method of retrieving digital data from peptide sequences.

In one embodiment, the method of retrieving digital data from peptide sequences may comprise: sequencing and determining an order of the peptide sequences; converting the peptide sequences with the determined order into a digital code; and decoding the digital data from the digital code.

In one embodiment, the converting of the peptide sequences with the determined order into the digital code may comprise mapping one or more amino acids in the peptide sequences into a bit pattern or a symbol pattern such that the digital code is obtained from a sequence of amino acids in the peptide sequences with the determined order.

In one embodiment, the method of retrieving digital data from peptide sequences may further comprise separating peptide sequences from a mixture of peptides.

In one embodiment, the digital code may comprise one or more order-checking bits, wherein the one or more order-checking bits may be related to the order of the bits or symbols in the digital code.

In one embodiment, the digital code may comprise one or more error-correction codes, wherein the one or more error-correction codes may comprise any one or combination of repetition code, convolutional code, turbo code, fountain code, LDPC code, RS code, Hadamard code, and Hamming code.

In one embodiment, decoding the digital data from digital code may use algorithms comprising belief-propagation algorithm, message-passing algorithm, and sum-product algorithm, and bit-flipping algorithm.

In one embodiment, the method of retrieving digital data from peptide sequences may further comprise: encoding the orders of one or more bits or symbols in the digital code; comparing the order-checking bits with the encoded orders of the one or more bits or symbols in the digital code; and indicating a detected error if the order-checking bits do not match the encoded orders of the one or more bits or symbols in the digital code.

According to a third aspect, there is provided a system for storing digital data into peptide sequences, the system comprising: a synthesizer configured to synthesize peptide sequences; at least one processor in communication with the synthesizer; and at least one memory including computer program code, the at least one memory and the computer program code configured to, with the at least one processor, cause the system at least to: encode the digital data into a digital code; translate the digital code into peptide sequences; and synthesize the translated peptide sequences using the synthesizer.

In one embodiment, when the system is caused to translate the digital code into peptide sequences, the at least one memory and the computer program code may be configured to, with the at least one processor, cause the system at least to map a bit pattern or a symbol pattern of the digital code into one or more amino acids such that the digital code is represented by a sequence of amino acids in the peptide sequences.

In one embodiment, the system may be further configured to form a mixture of peptides based on the translated peptide sequences.

In one embodiment, the at least one memory and the computer program code may be configured to, with the at least one processor, cause the system further to add one or more order-checking bits into the digital code, wherein the one or more order-checking bits may be related to the order of the bits or symbols in the digital code.

In one embodiment, the at least one memory and the computer program code may be configured to, with the at least one processor, cause the system further to add one or more error-correction codes into the digital code, wherein the one or more error-correction codes may comprise any one or combination of repetition code, convolutional code, turbo code, fountain code, LDPC code, RS code, Hadamard code, and Hamming code.

In one embodiment, the one or more error-correction codes may be generated based on the digital code, or both the digital code and order-checking bits added into the digital code.

In one embodiment, the peptide sequences may comprise distinct functional groups, isotope labels or affinity labels.

In one embodiment, the peptide sequences may comprise digital data bearing amino acids and non-digital data bearing amino acids.

According to a fourth aspect, there is provided a system for retrieving digital data from peptide sequences, the system comprising: a sequencer configured to sequence and determine an order of the peptide sequences; at least one processor in communication with the sequencer; and at least one memory including computer program code, the at least one memory and the computer program code configured to, with the at least one processor, cause the system at least to: sequence and determine the order of the peptide sequences using the sequencer; convert the peptide sequences with the determined order into a digital code; and decode the digital data from the digital code.

In one embodiment, when the system is caused to convert the peptide sequences with the determined order into a digital code, the at least one memory and the computer program code may be configured to, with the at least one processor, cause the system at least to map one or more amino acids in the peptide sequences into a bit pattern or a symbol pattern such that the digital code is obtained from a sequence of amino acids in the peptide sequences with the determined order.

In one embodiment, the sequencer may be further configured to separate peptide sequences from a mixture of peptides.

In one embodiment, the digital code may comprise one or more order-checking bits, wherein the one or more order-checking bits may be related to the order of the bits or symbols in the digital code.

In one embodiment, the digital code may comprise one or more error-correction codes, wherein the one or more error-correction codes may comprise any one or combination of repetition code, convolutional code, turbo code, fountain code, LDPC code, RS code, Hadamard code, and Hamming code.

In one embodiment, decoding the digital data from digital code may use algorithms comprising belief-propagation algorithm, message-passing algorithm, and sum-product algorithm, and bit-flipping algorithm.

In one embodiment, the at least one memory and the computer program code may be configured to, with the at least one processor, cause the system further to: encode the orders of one or more bits or symbols in the digital code; compare the order-checking bits with the encoded orders of the one or more bits or symbols in the digital code; and indicate a detected error if the order-checking bits do not match the encoded orders of the one or more bits or symbols in the digital code.

According to a fifth aspect, there is provided a computational method for assigning peptide sequences, wherein the method comprises an algorithm that recognizes and scores one or more features.

In one embodiment, the one or more of the features may comprise: length of consecutive amino acids retrieved; isotope labels; number of amino acids retrieved; match error; intensity; and number of occurrences for different ion types with different offsets.

Embodiments of the present disclosure provide an efficient data storage method and system using peptide sequences. The storage of digital data is performed by mapping a pattern of bits/symbols of the digital data in one or more amino acids of the peptide sequences. Firstly, peptides can offer a much higher data density than DNA. In addition to the 20 natural amino acids, unnatural amino acids can be also incorporated for data storage since the peptide sequencing can be performed using tandem mass spectrometry (MS/MS) with no enzyme recognition involved. The increased set of possible monomers, together with the lower masses of amino acids than those of nucleotides, could endow peptides a much higher data density than DNA. Secondly, peptides are typically less prone to degradation than DNA and can be still detectable even after millions of years when DNA would have already degraded. Furthermore, the peptide synthesis industry has been well developed, and various peptides can be easily obtained at a reasonable price. With the development of proteomics, the hardware and software for separation, detection and sequencing of peptides have been well established. Sequencing thousands of peptides in a mixture at a very small amount has become routine and can be completed within a short time of period.

BRIEF DESCRIPTION OF DRAWINGS

Embodiments of the disclosure will be better understood and readily apparent to one of ordinary skill in the art from the following written description, by way of example only, and in conjunction with the drawings, in which:

FIG. 1 depicts a schematic diagram of a system configured to store digital data into peptide sequences in accordance with embodiments of the disclosure.

FIG. 2 depicts a schematic diagram of a system configured to retrieve digital data from peptide sequences in accordance with embodiments of the disclosure.

FIG. 3 depicts a schematic diagram of a computer system suitable for use in the system depicted in FIGS. 1 and 2 in accordance with embodiments of the disclosure.

FIG. 4 depicts a flowchart illustrating a method of storing digital data into peptide sequences in accordance with embodiments of the disclosure.

FIG. 5 depicts a flowchart illustrating a method of retrieving digital data from peptide sequences in accordance with embodiments of the disclosure.

FIG. 6 depicts a flowchart illustrating a method of encoding digital data into a digital code, the digital code including order-checking bits and one or more low-density parity-check (LDPC) codes, in accordance with embodiments of the disclosure.

FIG. 7 depicts a flowchart illustrating a method of decoding digital data from a digital code, the digital code including order-checking bits and one or more LDPC codes, in accordance with embodiments of the disclosure.

FIG. 8 depicts an illustration of storing digital data into peptide sequences in accordance with embodiments of the disclosure.

FIGS. 9A-B depict illustrations of retrieving digital data from peptide sequences in accordance with embodiments of the disclosure.

FIG. 10 depicts an illustration of using an error-correction method to ensure data integrity in accordance with embodiments of the disclosure.

FIGS. 11A-S depict illustrations of examples of the mapping between bit(s)/symbol(s) to amino acid(s) in accordance with embodiments of the disclosure.

FIG. 12 depicts a flowchart illustrating a method of two-stage sequencing in accordance with embodiments of the disclosure.

FIG. 13 depicts an illustration of path finding in graph theory model in accordance with embodiments of the disclosure.

FIG. 14 depicts a flowchart illustrating a method of highest-intensity-tag based sequencing in accordance with embodiments of the disclosure.

And

FIG. 15 depicts an illustration of highest-intensity-tag based sequencing method in accordance with embodiments of the disclosure.

Skilled artisans will appreciate that elements in the figures are illustrated for simplicity and clarity and have not necessarily been depicted to scale. For example, the dimensions of some of the elements in the illustrations, block diagrams or flowcharts may be exaggerated in respect to other elements to help to improve understanding of the present embodiments.

DETAILED DESCRIPTION

Embodiments of the present disclosure will be described, by way of example only, with reference to the drawings. Like reference numerals and characters in the drawings refer to like elements or equivalents.

Some portions of the description which follows are explicitly or implicitly presented in terms of algorithms and functional or symbolic representations of operations on data within a computer memory. These algorithms and functional or symbolic representations are the means used by those skilled in the data processing arts to convey most effectively the substance of their work to others skilled in the art. An algorithm is here, and generally, conceived to be a self-consistent sequence of steps leading to a desired result. The steps are those requiring physical manipulations of physical quantities, such as electrical, magnetic or optical signals capable of being stored, transferred, combined, compared, and otherwise manipulated.

Unless specifically stated otherwise, and as apparent from the following, it will be appreciated that throughout the present specification, discussions utilizing terms such as “storing”, “retrieving”, “encoding”, “decoding”, “translating”, “converting”, “mapping”, “adding”, “appending”, “including”, “generating”, “comparing”, “determining”, “indicating”, “detecting”, “communicating”, or the like, refer to the action and processes of a computer system, or similar electronic device, that manipulates and transforms data represented as physical quantities within the computer system into other data similarly represented as physical quantities within the computer system or other information storage, transmission or display devices.

The present specification also discloses apparatus for performing the operations of the methods. Such apparatus may be specially constructed for the required purposes, or may include a computer or other computing device selectively activated or reconfigured by a computer program stored therein. The algorithms and displays presented herein are not inherently related to any particular computer or other apparatus. Various machines may be used with programs in accordance with the teachings herein. Alternatively, the construction of more specialized apparatus to perform the required method steps may be appropriate. The structure of a computer will appear from the description below.

In addition, the present specification also implicitly discloses a computer program, in that it would be apparent to the person skilled in the art that the individual steps of the method described herein may be put into effect by computer code. The computer program is not intended to be limited to any particular programming language and implementation thereof. It will be appreciated that a variety of programming languages and coding thereof may be used to implement the teachings of the disclosure contained herein. Moreover, the computer program is not intended to be limited to any particular control flow. There are many other variants of the computer program, which can use different control flows without departing from the spirit or scope of the disclosure.

Furthermore, one or more of the steps of the computer program may be performed in parallel rather than sequentially. Such a computer program may be stored on any computer readable medium. The computer readable medium may include storage devices such as magnetic or optical disks, memory chips, or other storage devices suitable for interfacing with a computer. The computer readable medium may also include a hard-wired medium such as exemplified in the Internet system, or wireless medium such as exemplified in the GSM mobile telephone system. The computer program when loaded and executed on a computer effectively results in an apparatus that implements the steps of the preferred method.

In embodiments of the present disclosure, use of the term ‘server’ may mean a single computing device or at least a computer network of interconnected computing devices which operate together to perform a particular function. In other words, the server may be contained within a single hardware unit or be distributed among several or many different hardware units.

Term Definitions

As used herein, the terms “peptide” and “peptide sequence” refer to a string of the amino acid residues, wherein the order of the assembly of the amino acid is the peptide sequence in the peptide. As used herein, the term “amino acid” refers to an organic compound that comprises an amine group (—NH₂) and a carboxyl group (—COOH). Amino acids can be natural, unusual, unnatural or synthetic, wherein examples include, but are not limited to, D or L optical isomers, and amino acid analogs and peptidomimetics. Further examples of naturally occurring amino acids can be, but are not limited to, alanine, arginine, asparagine, aspartic acid, asparagine (or aspartic acid), cysteine, glutamic acid, glutamine, glycine, histidine, isoleucine, leucine, lysine, methionine, phenylalanine, proline, serine, threonine, tryptophan, tyrosine or valine. In another example, groups of unnatural amino acids can be, but are not limited to, beta-homo-amino acids, N-methyl amino acids, alpha-methyl amino acids. Further examples of unnatural, unusual occurring or synthetic amino acids include, but are not limited to, citrulline, hydroxyproline, norleucine, 3-nitrotyrosine, nitroarginine, ornithine, naphthylalanine, methionine sulfoxide, methionine sulfone, cyclohexylalanine, ring-substituted phenylalanine, tyrosine or tryptophan derivatives (including but not limited to, for example, cyano-phenylalanine, o.tyrosine, m.tyrosine, hydroxy-tryptophan, methoxy-tryptophan), or halogen-labelled amino acids derivatives (including but not limited to, for example, fluoro/chloro/bromoliodo-phenylalanine, fluoro-tryptophan, fluorolchloro/bromoliodo-alanine).

As used herein, the term “peptide” refers to a polymer of 2 or more amino acids, amino acid analogs, peptidomimetics, or any combinations thereof. The subunits can be linked by peptide bonds. In another example, the subunits may be linked by other bonds such as, but not limiting to ester or ether bonds. Peptides also have a structure, wherein the structure can be generally understood to be linear or cyclic. In one example, a peptide can be, but is not limited to, dipeptides, tripeptides, oligopeptides or polypeptides. In another example, the peptide can be about 2 to 100 amino acids in length. In yet another example, the peptide can be about 2 to about 10 amino acids in length, about 5 to about 15 amino acids in length, about 10 to about 20 amino acids in length, about 15 to about 25 amino acids in length, about 20 to about 30 amino acids in length, about 25 to about 35 amino acids in length, about 30 to about 40 amino acids in length, about 35 to about 45 amino acids in length, about 40 to about 50 amino acids in length, about 45 to about 55 amino acids in length, about 50 to about 60 amino acids in length, about 55 to about 65 amino acids in length, about 60 to about 70 amino acids in length, about 65 to about 75 amino acids in length, about 70 to about 80 amino acids in length, about 75 to about 85 amino acids in length, about 80 to about 90 amino acids in length, about 85 to about 95 amino acids in length, about 90 to about 100 amino acids in length. In yet another example, the peptide can be 18 amino acids in length. Shorter peptides are cheaper to synthesize, and easier to be sequenced with reduced missed fragmentation, while longer peptides can store more data per peptide, reduce the number of peptides required for analysis, and reduce the address and error correction overhead.

As used herein, one or more amino acids in a peptide sequence represents a pattern of bits/symbols. A sequence of amino acids in a peptide sequence therefore represents a string of bits/symbols, which in turn represents part of the digital data. Therefore, the representation of digital data by peptide sequences is referred to herein as the digital data being stored in peptide sequences for simplicity sake. Since the digital data is expressed in a different form or system, the representation of digital data by peptide sequences can also be described as the digital data being encoded in peptide sequences. Therefore, the storing of digital data in peptide sequences is the same as the encoding of digital data in peptide sequences.

In the present disclosure, it is defined that

-   -   N′ as the length of the codeword for a LDPC code;     -   M′ as the number of parity bits for a LDPC code;     -   K′ as the number of information bits for a LDPC code with         K′=N′=M′;     -   H as the M′×N′ parity-check matrix for a LDPC code;     -   h_(i,j) as the element in the ith row and the jth column of         matrix H;     -   G as the generator matrix for a LDPC code with GH^(T)=0;     -   d=[d₁, d₂, . . . , d_(K),] as the vector of the information         bits;     -   p=[p₁, p₂, . . . , p_(M′)] as the vector of the parity bits;     -   c=[d p]=[d₁, d₂, . . . , d_(K′), p₁, p₂, . . . , p_(M′)] as the         codeword of a LDPC code;     -   partial sequence formed by consecutive amino acids as tag;     -   order-independent composition of amino acids as amino acid         combination (AAC);     -   the number of amino acids used as K;     -   the set of the amino acids used as A={a₁, a₂, . . . , a_(K)};     -   the mass set of the amino acid residues used as g={g₁, g₂, . . .         , g_(K)};     -   the length of the peptide sequence as N, which is the number of         the amino acids in a peptide;     -   the peptide sequence as P={P₁, p₂ . . . , P_(N)};     -   the mass set of the amino acid residues in peptide P as m={m₁,         m₂, . . . , m_(N)};     -   the mass of hydrogen or proton as m_(H);     -   the mass of hydroxyl group as m_(CH);     -   the ‘head amino acid’ is defined as the amino acid residue next         to the N-terminal of the peptide that is fixed throughout all         peptides;     -   the ‘tail amino acid’ is defined as the amino acid residue next         to the C-terminal of the peptide that is fixed throughout all         peptides;     -   the mass of the N-terminal functional group attached to the head         amino acid as m_(Ngroup), for peptides with unprotected         N-terminal, this is equal to m_(H);     -   the mass of the C-terminal functional group attached to the tail         amino acid as m_(Cgroup), for peptides with unprotected         C-terminal, this is equal to m_(CH);     -   the masses of the head and the tail amino acid residues in the         sequence as m_(head) and m_(tail), respectively, they can be         zero if there are no fixed amino acids;     -   the mass of the whole sequence as M, which is given by M=Σ^(N)         _(j=1)m_(j)+m_(Ngroup)+m_(Cgroup);     -   the mass set of the b-ions in peptide P as m_(b)={m_(b,1),         m_(b,2), . . . , m_(b,N+1), m_(b,N+2)}, where         m_(b,j+1)=m_(b,i)+m_(i), i.e., m_(b,1)=(m_(Ngroup)−m_(H)),         m_(b,2)=(m_(Ngroup)−m_(H))+m_(head), . . . ,         m_(b,N)=M−m_(H)−m_(Cgroup)−m_(tail),         m_(b,N+1)=M−m_(H)−m_(Cgroup), m_(b,N2)=M;     -   the mass set of the y-ions (complementary ions of b-ions) in         peptide P as m_(y)={m_(y,1), m_(y,2), . . . , m_(y,N+1),         m_(y,N+2)}, where m_(y)=M−m_(b), and m_(y,i)=m_(y,i)−m_(i),         i.e., m_(y,1)=M−(m_(Ngroup)−m_(H)),         m_(y,2)=M−(m_(Ngroup)−m_(H))−m_(head), . . . ,         m_(y,N)=m_(H)+m_(Cgroup)+m_(tail), m_(y,N+1)=m_(H)+m_(Cgroup),         m_(y,N+2)=0;     -   the mass difference set between the theoretical spectrum and the         experimental spectrum as Δ={Δ₁, Δ₂, . . . , Δ_(N)}, where         Δ_(i)∈[−δ, +ℏδ], i=1, 2, . . . , N, and δ is the tolerance         value;     -   the theoretical spectrum generated by peptide P as T(P);     -   the MS/MS spectrum obtained by tandem mass spectrometry as S;     -   the number of pairs of mass/charge ratio and intensity that         representing the spectrum S as L;     -   the set of the charges for spectrum S as z={z₁, z₂, . . . ,         z_(L)}, usually z; =1, 2, or 3;     -   the set of the mass/charge ratios for spectrum S as         (m/z)={(m/z)_(l), (m/z)₂, . . . , (m/z)_(L)};     -   the number of subsets in the spectrum S as ρ, where in each         subset, all (m/z) ratios are isotopes of a particular fragment,         with a charge value equaling the inverse of difference between         consecutive (m/z) ratios;     -   the ith subset as G_(i), i=1, 2, . . . , ρ;     -   the monoisotopic mass for subset G_(i) as m′_(i), i=1, 2, . . .         , ρ, which can be calculated by m′_(i)=(m/z)_(i,0)         z′_(i,0)−m_(H)z′_(i,0), where (m/z)_(i,0) is the lowest value in         subset G_(i), and z′_(i,0) is the corresponding charge for         (m/z)_(i,0);     -   the mass set of putative b-ions for spectrum S as         m′_(b)={m′_(b,1), m′_(b,2), . . . , m′_(b,L)}, where         m′_(b,i)=(m/z)_(i) z_(i)−m_(H) z_(i), i=1, 2, . . . , L;     -   the equivalent b-ion mass set of putative y-ions for spectrum S         as m′_(y)={m′_(y,1), m′_(y,2), . . . , m′_(y,L)}, where         m′_(y,i)=M−[(m/z)_(i) z_(i)−m_(H)z_(i)], i=1, 2, . . . , L;     -   the set of the intensities for spectrum S as I={I₁, I₂, . . . ,         I_(L)}, where the intensity I_(i) corresponds to the mass/charge         ratio (m/z)_(i) for each i, i=1, 2, . . . , L;     -   the mass of the putative b-ion with the Jth highest intensity         for spectrum S as m′_(B,J); the equivalent b-ion mass of the         putative y-ion with the Jth highest intensity for spectrum S as         m′_(γ,J);     -   the number of candidate sequences as n;     -   the number of masses with higher ranking intensity used for the         tag-finding scheme as W;     -   the (N−2) symbols of the peptide (excluding the head and tail)         in the block as S₁, S₂, . . . , S_(N-2);     -   the order-checking bit used to protect the order of symbols         S_(i) and S_(j) of a sequence as Q_(i,j), where {i,j}={1, 2},         {2, 3}, {15, 16};     -   the number of information bit set as μ;     -   the number of supplementary information bit set as γ,     -   the number of information bits in LDPC code or RS code as α,     -   the number of parity bits in LDPC code or RS code as β;     -   the information bit set as b={b₁, b₂, . . . , b_(μ)};     -   the supplementary information bit set as b′={b′₁, b′₂, . . . ,         b′_(V)};     -   the information bit set of the jth code as b^((j))={b₁ ^((j)),         b₂ ^((j)), . . . b_(α) ^((j))}, j=1, 2 and 3 for LDPC code, and         j=1, 2, 3 and 4 for RS code;     -   the parity bit set of the jth code as p^((j))={p₁ ^((j)), p₂         ^((j)), . . . , p_(β) ^((j))}, j=1, 2 and 3 for LDPC code, and         j=1, 2, 3 and 4 for RS code;     -   the interleaved parity bit set of the jth code as P^((j))={P₁         ^((j)), P₂ ^((j)), . . . , P_(β) ^((j))}, j=1, 2 and 3 for LDPC         code;     -   the address pairs as {A_(i,1), A_(i,2), . . . , A_(i,t)}, t=2 or         3, and i=1, 2, . . . , 8^(t);     -   the overall code rate as R;     -   the code rate of the LDPC code as R_(LDPC);     -   the code rate of the RS code as R_(RS).         Storing Digital Data into Peptide Sequences

Referring to FIG. 1, a schematic diagram of a system 100 configured to store digital data into peptide sequences is depicted. The system 100 includes a synthesizer 112 configured to synthesize peptide sequences, a processor 102 in communication with the synthesizer 112, and a memory 104 including computer program code. The memory 104 is in communication with the processor 102 such that the processor 102 can read the computer program code stored in the memory 104. The processor 102 can then execute the computer program code to encode digital data into peptide sequences. The processor 102 then transmits the peptide sequences to the synthesizer 112, so that the synthesizer 112 can synthesize the transmitted peptide sequences. These components can be integrated in one location or distributed among different locations, and the communications can be performed in real-time, in near-real-time, or in batches.

A synthesizer can be used to assemble amino acids into a peptide in a desired sequence. The synthesizer 112 can include, but not limited to, equipment/device for liquid-phase peptide synthesis, solid-phase peptide synthesis or microwave-assisted peptide synthesis. The synthesizer 112 can also be configured to include equipment/device for peptide purification methods, such as, but not limited to, reverse-phase chromatography, size-exclusion chromatography, ion exchange chromatography, partition chromatography, high-performance liquid chromatography, or any combinations thereof. The synthesizer 112 may be a single equipment/device or a series of equipment/devices in combination configured to synthesize the peptide sequences and/or form a mixture of peptides.

The system 100 can be used to implement method 400 for storing digital data into peptide sequences as depicted in FIG. 4. The processor 102 and the memory 104 including computer program code in the system 100 can be parts of a general purpose computing device as depicted in FIG. 3, in which the processor 102 corresponds to processor 302, and the memory 104 corresponds to memory 304. The method 400 broadly includes:

step 402: encoding digital data into a digital code; step 404: translating the digital code into peptide sequences; and step 406: synthesizing the translated peptide sequences.

At step 402, digital data can be encoded into a digital code by the processor 102.

The digital data may be retrieved from the memory 104 or received from an external device (e.g., an external hard drive, an optical disc, etc.). The digital data may be in the form of video, image, audio, text, computer program, and the like. The digital data is then encoded in a digital code, for example, in a collection of bits (0 s and 1 s) or symbols (e.g. numbers, letters). The collection of digital code may be presented in, but not limited to, forms of strings, arrays, vectors, matrices, data blocks, and the like. In practical applications, the encoding schemes can be user-defined, and additional codes can be added during the encoding process for various purposes, such as labelling, address indication, accuracy enhancement, redundancy, and error correcting.

For data security purposes, the digital data can be scrambled or encrypted or ciphered before being encoded in a digital code, which at step 404 is translated to one or more amino acids in one or more peptides. Examples of encryption systems include Rivest-Shamir-Adleman (RSA), Elliptic Curve Cryptography (ECC), Advanced Encryption Standard (AES) and Data Encryption Standard (DES). The digital data and/or the encrypted data and/or the encoded digital code can be interleaved before being mapped to amino acids in part of a peptide, or one or more peptides.

At step 404, the digital code obtained at step 402 is translated into peptide sequences. In embodiments of the present disclosure, one or more amino acids represent a bit pattern or a symbol pattern in the digital code. For example, the amino acid serine (“S”) may represent a bit pattern of 000, the amino acid threonine (“T”) may represent a bit pattern of 001. A sequence of amino acids in a peptide therefore corresponds to a part of the digital code and carries part of the information of the digital data. Examples of mapping methods between amino acid(s) and bit/symbol patterns are listed below, with alanine (“A”), threonine (“T”), leucine (“L”), valine (“V”), glutamic acid (“E”), histidine (“H”), tyrosine (“Y”), phenylalanine (“F”), aspartic acid (“D”), lysine (“K”), arginine (“R”), proline (“P”), tryptophan (“W”), cysteine (“C”), glycine (“G”), serine (“S”), asparagine (“N”), and glutamine (“Q”) as amino acid example representations. FIGS. 11A-S shows examples of the mapping between bit(s)/symbol(s) to amino acid(s).

Mapping method 1 Independent and fixed bit-to-amino-acid mapping, for example, Bit “0” is mapped to “A”; Bit “1” is mapped to “T” (FIG. 11A). Mapping method 2 Independent and fixed bits-to-amino-acid mapping, for example, Bits “000” are mapped to “A”; Bits “001” are mapped to “T”; Bits “010” are mapped to “L”; Bits “011” are mapped to “V” (FIG. 11B). Mapping method 3 Independent and fixed symbol-to-amino-acid mapping, for example, Symbols “0”, “1”, “2”, “3”, “4”, “5”, “6” and “7” are mapped to “A”, “T”, “L”, “V”, “E”, “H”, “Y” and “F”, respectively (FIG. 11C). Mapping method 4 Independent and fixed symbol-to-amino-acids mapping, for example, Symbol “0” is mapped to “AAA”; Symbol “1” is mapped to “AAT”; Symbol “7” is mapped to “TTT” (FIG. 11D). Mapping method 5 Independent and fixed symbols-to-amino-acid mapping, for example, Symbols “00” are mapped to “A”; Symbols “01” are mapped to “T”; Symbols “22” are mapped to “D” (FIG. 11E). Mapping method 6 Independent and fixed symbols-to-amino-acids mapping, for example, Symbols “00” are mapped to “AAA”; Symbols “01” are mapped to “AAT”; Symbols “77” are mapped to “VVV” (FIG. 11F). Mapping method 7 Dependent and fixed bit-to-amino-acid mapping, where the current bit-to-amino-acid mapping depends on the previous amino acid, for example, if the previous amino acid is “A”, then Bit “0” is mapped to “T” and Bit “1” is mapped to “A”. If the previous amino acid is “T”, then Bit “0” is mapped to “A” and Bit “1” is mapped to “T” (FIG. 11G) Other possible arrangements can also be used for dependent and fixed bit-to-amino-acid mapping (FIGS. 11H-J). Mapping method 8 Dependent and fixed symbol-to-amino-acid mapping, where the current symbol-to-amino-acid mapping depends on the previous amino acid, for example, in FIG. 11K(a), if the previous amino acid is “A”, then Symbols “0”, “1”, “2”, “3”, “4”, “5”, “6” and “7” are mapped to “T”, “L”, “V”, “E”, “H”, “Y”, “F” and “A”, respectively; if the previous amino acid is “T”, then Symbols “0”, “1”, “2”, “3”, “4”, “5”, “6” and “7” are mapped to “L”, “V”, “E”, “H”, “Y”, “F”, “A” and “T”, respectively. In FIG. 11K(b), if the previous amino acid is “A”, then the symbols cannot be mapped to “A” (FIGS. 11K(a), 11K(b)). Mapping method 9 Dependent and fixed symbol-to-amino-acids mapping, where the current symbol-to-amino-acids mapping depends on the previous amino acids, for example, in FIG. 11L(a), if the previous amino acids are “AAA”, then Symbols “0”, “1”, “2”, “3”, “4”, “5”, “6” and “7” are mapped to “AAT”, “ATA”, “ATT”, “TAA”, “TAT”, “TTA”, “TTT” and “AAA”, respectively; if the previous amino acids are “AAT”, then Symbols “0”, “1”, “2”, “3”, “4”, “5”, “6” and “7” are mapped to “ATA”, “ATT”, “TAA”, “TAT”, “TTA”, “TTT”, “AAA” and “AAT”, respectively. In FIG. 11L(b), if the previous amino acids are “AAA”, then the symbols cannot be mapped to “AAA” (FIGS. 11L(a), 11L(b)). Mapping method 10 Dependent and fixed symbols-to-amino-acid mapping, where the current symbols-to-amino-acid mapping depends on the previous amino acid, for example, if the previous amino acid is “A”, then Symbols “00”, “01”, “02”, “10”, “11”, “12”, “20”, “21” and “22” are mapped to “T”. “L”, “V”, “E”, “H”, “Y”, “F”, “D” and “A”, respectively; if the previous amino acid is “T”, then Symbols “00”, “01”, “02”, “10”, “11”, “12”, “20”, “21” and “22” are mapped to “L”, “V”, “E”, “H”, “Y”, “F”, “D”, “A” and “T”, respectively (FIG. 11M). Mapping method 11 Dependent and fixed symbols-to-amino-acids mapping, where the current symbols-to-amino-acids mapping depends on the previous amino acids, for example, if the previous amino acids are “AAA”, then Symbols “00”, “01”, “02”, “03”, . . . , “76” and “77” are mapped to “AAT”, “AAL”, “AAV”, “ATA”, . . . , “VVV” and “AAA”, respectively; if the previous amino acids are “AAT”, then Symbols “00”, “01”, “02”, “03”, . . . , “76” and “77” are mapped to “AAL”, “AAV”, “ATA”, “ATT”, . . . , “AAA” and “AAT”, respectively (FIG. 11N). Mapping method 12 Independent and random bit-to-amino-acid mapping, where the current bit-to-amino-acid mapping is independent of the previous amino acids, for example, bit “0” is mapped to “A” or “T” or “L” or “V”, where “A”, “T”, “L” and “V” can be selected with equal or unequal probabilities; bit “1” is mapped to “E” or “H” or “Y” or “F”, where “E”, “H”, “Y” and “F” can be selected with equal or unequal probabilities (FIG. 11O). Mapping method 13 Independent and random symbol-to-amino-acid mapping, where the current symbol-to-amino-acid mapping is independent of the previous amino acids, for example, symbol “0” is mapped to “A” or “T”, where “A” and “T” can be selected with equal or unequal probabilities; symbol “3” is mapped to “Y” or “F”, where “Y” and “F” can be selected with equal or unequal probabilities (FIG. 11P). Mapping method 14 Independent and random symbol-to-amino-acids mapping, where the current symbol-to-amino-acids mapping is independent of the previous amino acids, for example, symbol “0” is mapped to “AAA” or “AAT”, where “AAA” and “AAT” can be selected with equal or unequal probabilities; symbol “3” is mapped to “TTA” or “TTT”, where “TTA” and “TTT” can be selected with equal or unequal probabilities (FIG. 11Q). Mapping method 15 Independent and random symbols-to-amino-acid mapping, where the current symbols-to-amino-acid mapping is independent of the previous amino acids, for example, symbols “00” are mapped to “A” or “T”, where “A” and “T” can be selected with equal or unequal probabilities; symbols “22” are mapped to “N” or “Q”, where “N” and “Q” can be selected with equal or unequal probabilities (FIG. 11R). Mapping method 16 Independent and random symbols-to-amino-acids mapping, the current symbols-to-amino-acids mapping is independent of the previous amino acids, for example, symbols “00” are mapped to “AA” or “AT” or “AL” or “AV”, where “AA”, “AT”, “AL” and “AT” can be selected with equal or unequal probabilities; symbols “22” are mapped to “DA” or “DT” or “DL” or “DV”, where “DA”, “DT”, “DL” and “DT” can be selected with equal or unequal probabilities (FIG. 11S).

It is to be appreciated that there can be other variations for the mapping methods, and a combination of mapping methods can be used for mapping the digital code to amino acids. It is also to be appreciated that there can be other translation methods, other than mapping, to translate the digital code to peptide sequences.

At step 406, the translated peptide sequences are synthesized into peptides. As the peptide sequences are translated from the digital code, the synthesized peptides bear digital data. In embodiments of the present disclosure, the digital data bearing peptides can be mixed to form a mixture of peptides as less space is required in comparison to storing the discrete peptides. Peptides can be synthesized by methods including, but not limited to, liquid-phase peptide synthesis, solid-phase peptide synthesis or microwave-assisted peptide synthesis. Peptides can also undergo peptide purification such that the peptides obtained are not in a mixture, wherein the peptide purification methods include, but are not limited to, reverse-phase chromatography, size-exclusion chromatography, ion exchange chromatography, partition chromatography, high-performance liquid chromatography, or any combinations thereof.

The synthesized peptides and mixtures of peptides can be stored in different conditions. It would generally be understood that storage conditions are dependent on the properties of the peptides to be stored. In one example, the conditions can comprise, but not limited to, temperature or phases. In another example, peptides can be stored in the solid or liquid phase. In another example, the mixture of peptides can be kept in the dry room in a powder form or in a solution form and stored between −80° C. and −20° C.

Error-Correction Method

When performing step 402 of method 400, the digital data can be advantageously encoded to a digital code with error-correction codes. In one arrangement, the digital data is encoded in a digital code. Error-correction codes are then added to the digital code. Therefore, the error-correction codes are in addition to the digital code. Suitable error-correction methods provide the capability of recovering the original digital data when errors occur in the data storage and retrieval processes. Hereinafter, the term “starting digital code” is used to refer to the digital code generated from the original digital data. The starting digital code is a digital code without any error-correction codes.

FIG. 10 shows an example of an error-correction method. The example error-correction method adds two redundant bits to each bit in the starting digital code. Therefore, the error-correction method adds redundancy to the starting digital code. For example, bit 0 in the starting digital code is added with additional 0 bits, while bit 1 in the starting digital code is added with addition 1 bits. The digital code with the error-correction code in this example is transformed as (0, 1)→(000, 111). As used herein, the term “redundancy” refers to extra data that is generated for repetition of information or inclusion of additional information during the data storage/retrieval/transfer. By adding redundancy, error correction and detection can be advantageously achieved. In the example in FIG. 10, the error-correction method allows an error in any of the triplet of bits to be corrected by “majority vote” as demonstrated in the decoding table. The error-correction method also allows up to 2 bits of triplet omitted (not presented in the figure). It is worth noting that, although simple to implement, this triple modular redundancy is a relatively inefficient error-correction method. In the present disclosure, a more efficient error-correction method based on order-checking bits, and one or more LDPC codes or one or more RS codes is designed to correct errors during the synthesis, detection and sequencing of the peptides.

FIG. 6 shows a flowchart illustrating a method 600 of encoding digital data in a digital code, the digital code including order-checking bits and one or more LDPC codes. The order-checking bits and the one or more LDPC codes form an error-correction method. In one example, a digital code representing information of the digital data is provided as the starting digital code. At step 602, order-checking bits are generated based on one or more orders of bits/symbols, or segments of bits/symbols in the starting digital code. Order-checking bits have the function of protecting the correct order of bits/symbols in the starting digital code when the digital code is being processed during the data storage/retrieval/transfer.

In one arrangement, the order-checking bits are added into the starting digital code as redundant bits, which can contain information of the correct order of certain bits/symbols in the starting digital code. The value of the order-checking bits can be determined according to user-defined rules, for example, the order-checking bit of “1” is added to a symbol if the subsequent symbol has a lesser value. For example, a starting digital code has symbols of 32. An order-checking bit is then added according to the above example user-defined rules.

As the first symbol has a greater value (i.e., “3” representing 3 bits “011”) than the second symbol (i.e., “2” representing 3 bits “010”), a redundant bit “1” is added as an order-checking bit. The same process can be repeated for the second symbol to add an order-checking bit. Therefore, there can be one or more order-checking bits generated from the starting digital code. In one example, the generated order-checking bits can be added to the starting digital code and become part of the digital code before performing step 604.

At step 604, one or more LDPC codes are generated based on the digital code obtained from step 602. The digital code of step 602 includes the starting digital code and the order-checking bits. As such, the one or more LDPC codes are capable of correcting the starting digital code and the order-checking bits. LDPC code is a linear error-correction code constructed using a sparse bipartite graph. The encoding of LDPC codes into the digital code comprises: (1) constructing a sparse parity-check matrix, and (2) generating codewords with the matrix. A codeword contains information bits and parity bits, in which the parity bits are the redundant bits appended to the information bits. A parity bit is set to either 0 or 1 depending on the total number of the 1-bits in some of the information bits either even or odd, which can advantageously be used to detect and/or correct errors in the information bits. In alternative embodiments, error-correction codes can include any one or combination of repetition code, convolutional code, turbo code, fountain code, LDPC code, RS code, Hadamard code, and Hamming code.

At step 606, a block of bits or symbols is built using the information of the starting digital code (representing the original digital data), the order-checking bits (generated at step 602) and the one or more LDPC codes (generated at step 604). Although it is described that the digital data is encoded in a digital code having a block of bits or symbols, it is to be appreciated that the encoded digital code can be in any form determined by the user.

Example: Encoding Digital Data Using Order-Checking Bits and One or More LDPC Codes

As an illustrative example of method 600, digital data is encoded in a starting digital code with 850 information bits, b={b₁, b₂, . . . , b₈₅₀}. The starting digital code is to be processed using error-correction methods and then stored into 40 16-mer peptide sequences. In other words, a starting digital code of 850 information bits together with its error-correction codes is to be translated to 40 peptide sequences, each sequence having 16 amino acids. In one arrangement, the starting digital code is encoded to 40 sequences of symbols (i.e., Seq #1, Seq #2, . . . , Seq #40), each peptide sequence having 16 symbols (i.e., S₁, S₂, . . . , S₁₆) and each symbol represents a 3-bit pattern. Each symbol corresponds to an amino acid in the synthesized peptide sequence, and each sequence of symbols corresponds to a peptide sequence.

The starting digital code may be arranged in another format before adding error-correction codes. In this example, the starting digital code is reformatted into a matrix of sequences before adding the error-correction codes. Table 1 shows the sequences of symbols of this example. As shown in Table 1, each sequence (i.e., Seq #1, Seq #2, . . . , Seq #40) includes 16 symbols where 2 of the 16 symbols are used as an address pair (i.e., (A_(i,1), A_(i,2)), i=1, 2, . . . , 40), where i is the sequence number. In Table 1, the address pair occupies the first 2 symbols of each peptide sequence. In another arrangement, the address pair may occupy any 2 symbols of each peptide sequence.

The address pair of a peptide sequence (e.g., Seq #1) is used to indicate the position of the peptide sequence (e.g., Seq #1) in the order of the peptide sequences (e.g., Seq #1, Seq #2, etc.). For example, a peptide sequence Seq #j may have an address pair value of A_(1,1) of 000 and A_(1,2) of 001, which is combined to provide an address value of 000001. Further, the peptide sequence Seq #k may have an address pair value of A_(2,1) of 000 and A_(2,2) of 000, which is combined to provide an address value of 000000. Therefore, based on the address value, the peptide sequences of Table 1 commence with Seq #k followed by Seq #j. As such, when retrieving the data from the synthesized peptide by sequencing, the address pairs of the peptide sequences indicate the correct order of the peptide sequences, and in turn allow the digital code (inclusive of any error-correction codes) to be reconstructed based on order indicated by the address pairs. The addressing of the peptide sequences may also use more or less than 2 symbols of a peptide sequence.

Due to the 2-symbol address pairs, 14 symbols in a 16-mer peptide sequence are available to represent the information bits. Therefore, a total of 560 symbols are available in the 40 peptide sequences to represent the 850 information bits. In one arrangement, the information bits b are filled in the data block according to the following arrangements:

-   -   Bits b₁-b₄₀₀ are filled in the second and the third bits of         Symbols S₃-S₇ of the peptide sequences Seq #1 to Seq #40;     -   Bits b₄₀₁-b₇₆₀ are filled in Symbols S₁₄-S₁₆ of the peptide         sequences Seq #1 to Seq #40;     -   Bits b₇₆₁-b₈₅₀ are filled in Symbol S₁₃ of the peptide sequences         Seq #11 to Seq #40; and     -   Bits b₈₅₁-b₉₇₀ are filled in the first bit of Symbols S₄-S₆ and         are set to be zero. These bits are set to zero so that there are         at least three symbols in each sequence with values 0, 1, 2, 3.         In some embodiments, the amino acids to be mapped to 3-bit         symbols with values of 0, 1, 2, and 3 are hydrophilic amino         acids.

As can be seen in Table 1, there are also order-checking bits Q and redundant bits PP, i=1, 2, . . . , β, j=1, 2 and 3, of LDPC codes in the peptide sequences. The order-checking bits Q are added at step 602 and the redundant bits p_(i) ^((i)) of LDPC codes are added at step 604.

Starting at step 602, order-checking bits are generated based on the digital code arranged in Table 1. For each of the 40 peptide sequences, two order-checking bits are generated to protect the order of (i) S₁ and S₂, and (ii) S₁₅ and S₁₆, respectively. The order of S₁ and S₂ is protected by symbol S₃ and the order of S₁₅ and Se is protected by symbol S₇. In one arrangement, the first bit of symbol S₃ (Q_(1,2)) is an order-checking bit that protects the order of S₁ and S₂. The order of S₁₅ and S₁₆ is protected by an order-checking bit in the first bit of symbol S₇ (Q_(15,16)). In other arrangements, the second or third bit in the 3-bit symbol S₃ or S₇ may be used as the order-checking bit.

Therefore, in this example, the first bit of S₃ (Q_(1,2)) checks the order of symbols S₁ and S₂, and the first bit of S₇ (Q_(15,16)) checks the order of symbols S₁₅ and S₁₆. In this example, the user-defined rule which determines the value of an order-checking bit is:

-   -   if the value of symbol S₁ is larger than or equal to the value         of symbol S_(i+1), the order-checking bit is assigned as “1”;         and     -   if the value of symbol S_(i) is smaller than the value of symbol         S_(i+1), the order-checking bit is assigned as “0”.         For example, if S₁₅=101 and S₁₆=001, the value of the         order-checking bit (Q_(15,16)) in symbol S₇ is “1” according to         the rule. Also, if S₁=110 and S₂=111, the value of the         order-checking bit (Q_(1,2)) in symbol S₃ is “0” according to         the rule. It is possible to generate the order-checking bits         based on other user-defined rules that are not presented here.         It is also possible to use different user-defined rules to         generate different order-checking bits in the same digital code.

At step 604, one or more LDPC codes are generated based on the starting digital code and the order-checking bits. Three LDPC codes are used in the example shown in Table 1. In this example, symbols S₈ to S₁₂ (in peptide sequences Seq #1 to Seq #40) and symbol S₁₃ (in peptide sequences Seq #1 to Seq #10) are filled with the parity bits generated by the LDPC codes. The number of parity bits in the peptide sequences of Table 1 is 630, and the total number of bits to be encoded is 1050 (inclusive of 850 information bits b, 120 bits of zero bits, and 80 bits of order-checking bits). In this embodiment, the address pairs are not included in the 1050 bits for LDPC encoding purpose, which allows more amino acids to be used for storing digital data. In other words, the number of information bits/symbols corresponding to the digital data is increased in the 40×16 data block. During the decoding process, the address pairs are assumed to be correct, based on which the peptide sequences can be arranged. In some other embodiments, the address pairs can be included in the information bits and considered for LDPC encoding, or other error-correction codes. In particular, if the length of each peptide is much longer (e.g. 500-mer), it is more efficient to encode each peptide separately to protect its address and the digital data stored in the peptide. For this example with 1050 bits to be encoded by LDPC, if one LDPC code is generated, the LDPC code should have a codeword comprising 1680 bits, represented as (1680, 1050). Since there is a total of 850 information bits, the overall code rate R is R=850/1680=0.5060. In a preferred method, since there are 3 bits for each symbol, three (560, 350) LDPC codes are generated instead of one (1680, 1050) LDPC code, and the code rate of the LDPC code R_(LDPC) is R_(LDPC)=350/560=0.625. In an alternative embodiment, since the bits of the 3-bit symbols can be divided into 3 sets, it is possible to use 3 different error-correction codes which may have dissimilar error-correcting capabilities, thereby in combination providing a more robust and efficient error-correction performance. In other words, the jth (j=1, 2 and 3) bits of all the symbols after step 602 (all 40 sequences of Symbols S₃-S₇ and S₁₄-S₁₆ and the last 30 sequences of S₁₃) are passed to the jth LDPC code as the information bits. The three (560, 350) LDPC codes are generated based on the encoding process below.

TABLE 1 40 × 16 block of 3-bit symbols including 850 information bits, 80 order-checking bits and 3 LDPC codes. Symbol S₁ S₂ S₃ S₄ S₅ S₆ S₇ S₈ S₉ S₁₀ S₁₁ S₁₂ S₁₃ S₁₄ S₁₅ S₁₆ Seq #1 A_(1,1) A_(1,2) Q_(1,2) b₈₅₁ b₈₅₂ b₈₅₃ Q_(15,16) P₁ ⁽¹⁾ P₂ ⁽¹⁾ P₃ ⁽¹⁾ P₄ ⁽¹⁾ P₅ ⁽¹⁾ P₂₀₁ ⁽¹⁾ b₄₀₁ b₄₀₂ b₄₀₃ b₁ b₂ b₃ b₄ b₅ P₁ ⁽²⁾ P₂ ⁽²⁾ P₃ ⁽²⁾ P₄ ⁽²⁾ P₅ ⁽²⁾ P₂₀₁ ⁽²⁾ b₄₀₄ b₄₀₅ b₄₀₆ b₆ b₇ b₈ b₉ b₁₀ P₁ ⁽³⁾ P₂ ⁽³⁾ P₃ ⁽³⁾ P₄ ⁽³⁾ P₅ ⁽³⁾ P₂₀₁ ⁽³⁾ b₄₀₇ b₄₀₈ b₄₀₉ Seq #2 A_(2,1) A_(2,2) Q_(1,2) b₈₅₄ b₈₅₄ b₈₅₆ Q_(15,16) P₆ ⁽¹⁾ P₇ ⁽¹⁾ P₈ ⁽¹⁾ P₉ ⁽¹⁾ P₁₀ ⁽¹⁾ P₂₀₂ ⁽¹⁾ b₄₁₀ b₄₁₁ b₄₁₂ b₁₁ b₁₂ b₁₃ b₁₄ b₁₅ P₆ ⁽²⁾ P₇ ⁽²⁾ P₈ ⁽²⁾ P₉ ⁽²⁾ P₁₀ ⁽²⁾ P₂₀₂ ⁽²⁾ b₄₁₃ b₄₁₄ b₄₁₅ b₁₆ b₁₇ b₁₈ b₁₉ b₂₀ P₆ ⁽³⁾ P₇ ⁽³⁾ P₈ ⁽³⁾ P₉ ⁽³⁾ P₁₀ ⁽³⁾ P₂₀₂ ⁽³⁾ b₄₁₆ b₄₁₇ b₄₁₈ Seq #3 A_(3,1) A_(3,2) Q_(1,2) b₈₅₇ b₈₅₈ b₈₅₉ Q_(15,16) P₁₁ ⁽¹⁾ P₁₂ ⁽¹⁾ P₁₃ ⁽¹⁾ P₁₄ ⁽¹⁾ P₁₅ ⁽¹⁾ P₂₀₃ ⁽¹⁾ b₄₁₉ b₄₂₀ b₄₂₁ b₂₁ b₂₂ b₂₃ b₂₄ b₂₅ P₁₁ ⁽²⁾ P₁₂ ⁽²⁾ P₁₃ ⁽²⁾ P₁₄ ⁽²⁾ P₁₅ ⁽²⁾ P₂₀₃ ⁽²⁾ b₄₂₂ b₄₂₃ b₄₂₄ b₂₆ b₂₇ b₂₈ b₂₉ b₃₀ P₁₁ ⁽³⁾ P₁₂ ⁽³⁾ P₁₃ ⁽³⁾ P₁₄ ⁽³⁾ P₁₅ ⁽³⁾ P₂₀₃ ⁽³⁾ b₄₂₅ b₄₂₆ b₄₂₇ . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Seq #10 A_(10,1) A_(10,2) Q_(1,2) b₈₇₈ b₈₇₉ b₈₈₀ Q_(15,16) P₄₆ ⁽¹⁾ P₄₇ ⁽¹⁾ P₄₈ ⁽¹⁾ P₄₉ ⁽¹⁾ P₅₀ ⁽¹⁾ P₂₁₀ ⁽¹⁾ b₄₈₂ b₄₈₃ b₄₈₄ b₉₁ b₉₂ b₉₃ b₉₄ b₉₅ P₄₆ ⁽²⁾ P₄₇ ⁽²⁾ P₄₈ ⁽²⁾ P₄₉ ⁽²⁾ P₅₀ ⁽²⁾ P₂₁₀ ⁽²⁾ b₄₈₅ b₄₈₆ b₄₈₇ b₉₆ b₉₇ b₉₈ b₉₉ b₁₀₀ P₄₆ ⁽³⁾ P₄₇ ⁽³⁾ P₄₈ ⁽³⁾ P₄₉ ⁽³⁾ P₅₀ ⁽³⁾ P₂₁₀ ⁽³⁾ b₄₈₈ b₄₈₉ b₄₉₀ Seq #11 A_(11,1) A_(11,2) Q_(1,2) b₈₈₁ b₈₈₂ b₈₈₃ Q_(15,16) P₅₁ ⁽¹⁾ P₅₂ ⁽¹⁾ P₅₃ ⁽¹⁾ P₅₄ ⁽¹⁾ P₅₅ ⁽¹⁾ b₇₆₁ b₄₉₁ b₄₉₂ b₄₉₃ b₁₀₁ b₁₀₂ b₁₀₃ b₁₀₄ b₁₀₅ P₅₁ ⁽²⁾ P₅₂ ⁽²⁾ P₅₃ ⁽²⁾ P₅₄ ⁽²⁾ P₅₅ ⁽²⁾ b₇₆₂ b₄₉₄ b₄₉₅ b₄₉₆ b₁₀₆ b₁₀₇ b₁₀₈ b₁₀₉ b₁₁₀ P₅₁ ⁽³⁾ P₅₂ ⁽³⁾ P₅₃ ⁽³⁾ P₅₄ ⁽³⁾ P₅₅ ⁽³⁾ b₇₆₃ b₄₉₇ b₄₉₈ b₄₉₉ . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Seq #39 A_(39,1) A_(39,2) Q_(1,2) b₉₆₅ b₉₆₆ b₉₆₇ Q_(15,16) P₁₉₁ ⁽¹⁾ P₁₉₂ ⁽¹⁾ P₁₉₃ ⁽¹⁾ P₁₉₄ ⁽¹⁾ P₁₉₅ ⁽¹⁾ b₈₄₅ b₇₄₃ b₇₄₄ b₇₄₅ b₃₈₁ b₃₈₂ b₃₈₃ b₃₈₄ b₃₈₅ P₁₉₁ ⁽²⁾ P₁₉₂ ⁽²⁾ P₁₉₃ ⁽²⁾ P₁₉₄ ⁽²⁾ P₁₉₅ ⁽²⁾ b₈₄₆ b₇₄₆ b₇₄₇ b₇₄₈ b₃₈₆ b₃₈₇ b₃₈₈ b₃₈₉ b₃₉₀ P₁₉₁ ⁽³⁾ P₁₉₂ ⁽³⁾ P₁₉₃ ⁽³⁾ P₁₉₄ ⁽³⁾ P₁₉₅ ⁽³⁾ b₈₄₇ b₇₄₉ b₇₅₀ b₇₅₁ Seq #40 A_(40,1) A_(40,2) Q_(1,2) b₉₆₈ b₉₆₉ b₉₇₀ Q_(15,16) P₁₉₆ ⁽¹⁾ P₁₉₇ ⁽¹⁾ P₁₉₈ ⁽¹⁾ P₁₉₉ ⁽¹⁾ P₂₀₀ ⁽¹⁾ b₈₄₈ b₇₅₂ b₇₅₃ b₇₅₄ b₃₉₁ b₃₉₂ b₃₉₃ b₃₉₄ b₃₉₅ P₁₉₆ ⁽²⁾ P₁₉₇ ⁽²⁾ P₁₉₈ ⁽²⁾ P₁₉₉ ⁽²⁾ P₂₀₀ ⁽²⁾ b₈₄₉ b₇₅₅ b₇₅₆ b₇₅₇ b₃₉₆ b₃₉₇ b₃₉₈ b₃₉₉ b₄₀₀ P₁₉₆ ⁽³⁾ P₁₉₇ ⁽³⁾ P₁₉₈ ⁽³⁾ P₁₉₉ ⁽³⁾ P₂₀₀ ⁽³⁾ b₈₅₀ b₇₅₈ b₇₅₉ b₇₆₀

Given a M′×N′ parity-check matrix H for the LDPC code of length N′. In theory, the information bits (d) are encoded by using

c=dG with GH^(T)=0,  (1)

where the superscript^(T) is the transpose operator, c=[d p]=[d₁, d₂, . . . , d_(K′), p₁, p₂, . . . , p_(M′)] represents a codeword, d=[d₁, d₂, . . . , d_(K′)] is the vector of the information bits with K′=N′−M and p=[p₁, p₂, . . . , p_(M′)] is the vector of the parity bits. G is the generator matrix and 0 is the all-zero matrix. Then the information bits can be decoded by

cH ^(T)=0.  (2)

Based on Eq. (2), it can be obtained that

$\begin{matrix} {{{{\sum\limits_{j = 1}^{K^{\prime}}\; {h_{i,j}d_{j}}} + {\sum\limits_{l = 1}^{M^{\prime}}\; {h_{i,{K + i}}p_{i}}}} = {0\mspace{14mu} {mod}\mspace{14mu} 2}},{i = 1},2,\ldots \;,M^{\prime \;}} & (3) \end{matrix}$

where h_(i,j) represents the element in the jth row and the jth column of matrix H. Generally, the generator matrix G is difficult to be obtained when the code length is long. Hence, the structured code is used for easy encoding purpose. A simple example for the code with the dual-diagonal structure is shown in Table 2, the 6×16 parity-check matrix represents a LDPC code with length of 16. Then there are 10 information bits (i.e., d₁, d₂, . . . , d₁₀) and 6 parity bits (i.e., p₁, p₂, . . . , p₆). The parity bits can be evaluated by using the information bits as follows

p ₁ =d ₁ +d ₄ +d ₈ mod 2;  (4)

p ₂ =d ₃ +d ₆ +d ₇ +p ₁ mod 2;  (5)

p ₃ =d ₂ +d ₅ +d ₉ +p ₂ mod 2;  (6)

p ₄ =d ₁ +d ₆ +d ₁₀ +p ₃ mod 2;  (7)

p ₅ =d ₂ +d ₄ +d ₇ +d ₈ +p ₄ mod 2;  (8)

p ₆ =d ₃ +d ₅ +d ₉ +d ₁₀ +p ₅ mod 2.  (9)

Thus the codeword is formed by a set of 16 bits {d₁, d₂, . . . , d₁₀, p₁, p₂, . . . , p₆}. The decoding is performed such that all information bits can fulfill all of the above equations. Suppose that the information bit d₁ is missing in the received sequence. Then d₁ can be estimated by applying Eq. (4) or (7)

d ₁ =d ₄ +d ₈ +p ₁ mod 2;  (10)

d ₁ =d ₆ +d ₁₀ +p ₃ +p ₄ mod 2.  (11)

Usually, the LDPC code can be decoded by using the iterative message-passing algorithms to find a codeword c such that cH^(T)=0 (T. Richardson and R. Urbanke, “The capacity of low-density parity check codes under message-passing decoding,” IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 599-618, 2001).

TABLE 2 Example of a parity-check matrix H for the LDPC code. b₁ b₂ b₃ b₄ b₅ b₆ b₇ b₈ b₉ b₁₀ p₁ p₂ p₃ p₄ p₅ p₆ 1 0 0 1 0 0 0 1 0 0 1 0 0 0 0 0 0 0 1 0 0 1 1 0 0 0 1 1 0 0 0 0 0 1 0 0 1 0 0 0 1 0 0 1 1 0 0 0 1 0 0 0 0 1 0 0 0 1 0 0 1 1 0 0 0 1 0 1 0 0 1 1 0 0 0 0 0 1 1 0 0 0 1 0 1 0 0 0 1 1 0 0 0 0 1 1

Proceeding to step 606, 630 parity bits of the three (560, 350) LDPC codes are filled in the available bits of the 40×16 data block. In a preferred embodiment, due to the dual-diagonal structure of parity check matrix and the peptide error pattern, a random interleaver can be added to the output of each LDPC code to disturb the orders of the parity bits before inputting the LDPC code into the peptide sequences. Interleaving is a process of arranging data in a non-contiguous manner. It is common that errors occur to a number of bits/symbols in a digital code during the data storage/retrieval/transfer. When interleaving is applied, the errors affect bits/symbols that are not in fact next to one another when the digital code was created. As a result, when the data is de-interleaved, the errors are spread throughout the digital code rather than being focused in a particular spot, which makes it easier for error detection and correction. As an example, at step 706 of the method 700 (see FIG. 7 and associated discussion below), if the orders of the estimated symbols do not match with the first bits of the estimated symbols S₃ and S₇ (the order-checking bits), the corresponding symbol sequences in the data block are erased. When this happens, the LDPC decoding process is needed to retrieve these erased bits/symbols. By using an interleaver, it can advantageously ensure that these erased bits/symbols are not consecutive bits/symbols of an LDPC code. Instead, the erased bits/symbols are uniformly or randomly distributed in the LDPC code, which makes the recovery process easier.

In this example, the output parity-bit set of the jth LDPC code is defined as p^((j))={p₁ ^((j)), p₂ ^((j)), . . . , p₂₁₀ ^((j))} (j=1, 2 and 3), and the interleaved parity-bit set for the jth LDPC code is defined as P^((j))={P₁ ^((j)), P₂ ^((j)), . . . , P₂₁₀ ^((j))} (j=1, 2 and 3). The set P^((j)) corresponds to set p^((j)) (j=1, 2 and 3). The set P^((j)) (j=(j=1, 2 and 3) is arranged in the jth bits of Symbols S₈, S₉, S₁₀, S₁₁ and S₁₂ for all sequences, and Symbol S₁₃ of the first 10 sequences. In the end, the output 40×16 data block has 40×16×3=1920 bit positions, with 850 information bits, 120 bits of zero bits, 240 bits of address pairs, 80 bits of order-checking bits and 630 parity bits in the LDPC code.

Other Error-Correction Method: Reed-Soloman Code

Reed-Soloman (RS) code can alternatively be used for the error-correction method for step 604. Assume that the requirements for the coding scheme are:

(i) 10% of the 3-symbol sequences {S₅S₆S₇} and {S₈S₉S₁₀} cannot be recovered correctly; (ii) 15% of the 3-symbol sequences {S₁₁S₁₂S₁₃} and {S₁₄S₁₅S₁₆} cannot be recovered correctly; and (iii) the order of symbols S₁ and S₂, the order of symbols S₂ and S₃, and the order of symbols S₁₅ and S₁₆ in a sequence may be exchanged. The error-correction method includes: (i) three order-checking bits for each peptide sequence with the first order-checking bit to protect the order of the first two symbols, the second order-checking bit to protect the order of the second and the third symbols, and the third order-checking bit to protect the order of the last two symbols in each sequence; and (ii) four RS codes to recover the original data even when any arbitrary 10% 3-symbol sequences {S₅S₆S₇}, any arbitrary 10% 3-symbol sequences {S₈S₉S₁₀}, any arbitrary 15% 3-symbol sequences {S₁₁S₁₂S₁₃}, and any arbitrary 15% 3-symbol sequences {S₁₄S₁₅S₁₆}, cannot be recovered correctly.

Assuming the digital code is stored into 511 peptide sequences of length of 16 amino acids. Accordingly, a 511×16 block of symbols is constructed (Table 3), which comprises 511×16×3=24528 bits. The 3-symbol sets {A_(i,1), A_(i,2), A_(i,3)}, i=1, 2, . . . , 511 are used for addressing, with Symbols S₁ to S₃ having the values of {0 0 0}, {0 0 1}, {0 0 2}, . . . , {7 7 5}, {7 7 6}. The three bits of Symbol S₄ are the three order-checking bits used to protect the order of Symbols S₁ and S₂, the order of Symbols S₂ and S₃, and the order of Symbols S₁₅ and S₁₆, respectively. Then there are 511×12×3=18396 bit positions in Symbols S₅ to S₁₆ of the block to store the information and parity bits for the RS codes.

Due to different protection requirements for partial sequences {S₅S₆S₇S₈S₉S₁₀} and {S₁₁S₁₁S₁₂S₁₃S₁₄S₁₅S₁₆}, two (511, 409) RS codes are used for partial sequences {S₅S₆S₇} and {S₈S₉S₁₀}, another two (511, 357) RS codes are used for partial sequences {S₁₁S₁₂S₁₃} and {S₁₄S₁₅S₁₆}. Each symbol in RS code comprises 9 bits. The first 102 rows of {S₅S₆S₇S₈S₉S₁₀} and the first 154 rows of {S₁₁S₁₂S₁₃S₁₄S₁₅S₁₆} are used to record the parity symbols of the (511, 409) and (511, 357) RS codes, respectively. For example, the 9 bits p₁ ^((j)), p₂ ^((j)), . . . , p₉ ^((j)) (j=1, 2, 3 and 4) of Sequence 1 represent the first parity symbol in the jth RS code. The remaining rows are used to store the information bits. For example, the 9 bits b₁, b₂, . . . , b₉ in {S₅S₆S₇} of Sequence 103, and the 9 bits b₁₉, b₂₀, . . . , b₂₇ in {S₅S₆S₇} of Sequence 104, are convert to two symbols of the first RS code. Similarly, the 9 bits b₁₀, b₁₁, . . . , b₁₈ in {S₈S₉S₁₀} of Sequence 103, and the 9 bits b₂₈, b₂₉, . . . , b₃₆ in {S₈S₉S₁₀} of Sequence 104, form two symbols of the second RS code. The (511, 409) RS and (511, 357) RS codes can correct up to 51 and 77 9-bit symbol errors, respectively. The code rates R_(RS) of the (511, 409) and (511, 357) RS codes are given by R_(RS)=409/511=0.8004, and R_(RS)=357/511=0.6986, respectively. Moreover, the numbers of total information bits and total parity bits of all four RS codes are given by (409+357)×2×9=13788 and (102+154)×2×9=4608, respectively. Then the maximum overall code rate R of the block can be calculated by R=13788/24528=0.5621.

Assuming that there are two sets of information data, 13656 information bits in Set b and 96 information bits in Set b′. Then the overall code rate R of the block is given by R=13752/24528=0.5607. All 13752 information bits are filled in Symbols {S₅S₆S₇S₈S₉S₁₀} of Sequences 103 to 511 and Symbols {S₁₁S₁₂S₁₃S₁₄S₁₅S₁₆} of Sequences 155 to 511. The information set b′ is arranged in the last 3 sequences. The remaining 13788−13752=36 information bit positions in the block are set to zeros because no more information needs to be sent. These zero-bit positions are located at the first bits in S₁₆ of Sequences 485 to 508, the first bits in S₁₅ of Sequences 509 to 511, and the 3 bits in Symbol S₁₆ of Sequences 509 to 511.

TABLE 3 51 1× 16 block of 3-bit symbols including 13752 information bits, 1533 order-checking bits and 4 RS codes. Symbol S₁ S₂ S₃ S₄ S₅ S₆ S₇ S₈ Seq #1 A_(1,1) A_(1,2) A_(1,3) Q_(1,2) p₁ ⁽¹⁾ p₄ ⁽¹⁾ p₇ ⁽¹⁾ p₁ ⁽²⁾ Q_(2,3) p₂ ⁽¹⁾ p₅ ⁽¹⁾ p₈ ⁽¹⁾ p₂ ⁽²⁾ Q_(15,16) p₃ ⁽¹⁾ p₆ ⁽¹⁾ p₉ ⁽¹⁾ p₃ ⁽²⁾ Seq #2 A_(2,1) A_(2,2) A_(2,3) Q_(1,2) p₁₀ ⁽¹⁾ p₁₃ ⁽¹⁾ p₁₆ ⁽¹⁾ p₁₀ ⁽²⁾ Q_(2,3) p₁₁ ⁽¹⁾ p₁₄ ⁽¹⁾ p₁₇ ⁽¹⁾ p₁₁ ⁽²⁾ Q_(15,16) p₁₂ ⁽¹⁾ p₁₅ ⁽¹⁾ p₁₈ ⁽¹⁾ p₁₂ ⁽²⁾ . . . . . . . . . . . . . . . . . . . . . . . . . . . Seq #102 A_(102,1) A_(102,2) A_(102,3) Q_(1,2) p₉₁₀ ⁽¹⁾ p₉₁₃ ⁽¹⁾ p₉₁₆ ⁽¹⁾ p₉₁₀ ⁽²⁾ Q_(2,3) p₉₁₁ ⁽¹⁾ p₉₁₄ ⁽¹⁾ p₉₁₇ ⁽¹⁾ p₉₁₁ ⁽²⁾ Q_(15,16) p₉₁₂ ⁽¹⁾ p₉₁₅ ⁽¹⁾ p₉₁₈ ⁽¹⁾ p₉₁₂ ⁽²⁾ Seq #103 A_(103,1) A_(103,2) A_(103,3) Q_(1,2) b₁ b₄ b₇ b₁₀ Q_(2,3) b₂ b₅ b₈ b₁₁ Q_(15,16) b₃ b₆ b₉ b₁₂ Seq #104 A_(104,1) A_(104,2) A_(104,3) Q_(1,2) b₁₉ b₂₂ b₂₅ b₂₈ Q_(2,3) b₂₀ b₂₃ b₂₆ b₂₉ Q_(15,16) b₂₁ b₂₄ b₂₇ b₃₀ . . . . . . . . . . . . . . . . . . . . . . . . . . . Seq #154 A_(154,1) A_(154,2) A_(154,3) Q_(1,2) b₉₁₉ b₉₂₂ b₉₂₅ b₉₂₈ Q_(2,3) b₉₂₀ b₉₂₃ b₉₂₆ b₉₂₉ Q_(15,16) b₉₂₁ b₉₂₄ b₉₂₇ b₉₃₀ Seq #155 A_(155,1) A_(155,2) A_(155,3) Q_(1,2) b₉₃₇ b₉₄₀ b₉₄₃ b₉₄₆ Q_(2,3) b₉₃₈ b₉₄₁ b₉₄₄ b₉₄₇ Q_(15,16) b₉₃₉ b₉₄₂ b₉₄₅ b₉₄₈ Seq #156 A_(156,1) A_(156,2) A_(156,3) Q_(1,2) b₉₅₅ b₉₅₈ b₉₆₁ b₉₆₄ Q_(2,3) b₉₅₆ b₉₅₉ b₉₆₂ b₉₆₅ Q_(15,16) b₉₅₇ b₉₆₀ b₉₆₃ b₉₆₆ . . . . . . . . . . . . . . . . . . . . . . . . . . . Seq #485 A_(485,1) A_(485,2) A_(485,3) Q_(1,2) b₆₈₇₇ b₆₈₈₀ b₆₈₈₃ b₆₈₈₆ Q_(2,3) b₆₈₇₈ b₆₈₈₁ b₆₈₈₄ b₆₈₈₇ Q_(15,16) b₆₈₇₉ b₆₈₈₂ b₆₈₈₅ b₆₈₈₈ . . . . . . . . . . . . . . . . . . . . . . . . . . . Seq #508 A_(508,1) A_(508,2) A_(508,3) Q_(1,2) b₇₂₉₁ b₇₂₉₄ b₇₂₉₇ b₇₃₀₀ Q_(2,3) b₇₂₉₂ b₇₂₉₅ b₇₂₉₈ b₇₃₀₁ Q_(15,16) b₇₂₉₃ b₇₂₉₆ b₇₂₉₉ b₇₃₀₂ Seq #509 A_(509,1) A_(509,2) A_(509,3) Q_(1,2) b′₁ b′₄ b′₇ b′₁₀ Q_(2,3) b′₂ b′₅ b′₈ b′₁₁ Q_(15,16) b′₃ b′₆ b′₉ b′₁₂ Seq #510 A_(510,1) A_(510,2) A_(510,3) Q_(1,2) b′₁₉ b′₂₂ b′₂₅ b′₂₈ Q_(2,3) b′₂₀ b′₂₃ b′₂₆ b′₂₉ Q_(15,16) b′₂₁ b′₂₄ b′₂₇ b′₃₀ Seq #511 A_(511,1) A_(511,2) A_(511,3) Q_(1,2) b′₃₇ b′₄₀ b′₄₃ b′₄₆ Q_(2,3) b′₃₈ b′₄₁ b′₄₄ b′₄₇ Q_(15,16) b′₃₉ b′₄₂ b′₄₅ b′₄₈ Symbol S₉ S₁₀ S₁₁ S₁₂ S₁₃ S₁₄ S₁₅ S₁₆ Seq #1 p₄ ⁽²⁾ p₇ ⁽²⁾ p₁ ⁽³⁾ p₄ ⁽³⁾ p₇ ⁽³⁾ p₁ ⁽⁴⁾ p₄ ⁽⁴⁾ p₇ ⁽⁴⁾ p₅ ⁽²⁾ p₈ ⁽²⁾ p₂ ⁽³⁾ p₅ ⁽³⁾ p₈ ⁽³⁾ p₂ ⁽⁴⁾ p₅ ⁽⁴⁾ p₈ ⁽⁴⁾ p₆ ⁽²⁾ p₉ ⁽²⁾ p₃ ⁽³⁾ p₆ ⁽³⁾ p₉ ⁽³⁾ p₃ ⁽⁴⁾ p₆ ⁽⁴⁾ p₉ ⁽⁴⁾ Seq #2 p₁₃ ⁽²⁾ p₁₆ ⁽²⁾ p₁₀ ⁽³⁾ p₁₃ ⁽³⁾ p₁₆ ⁽³⁾ p₁₀ ⁽⁴⁾ p₁₃ ⁽⁴⁾ p₁₆ ⁽⁴⁾ p₁₄ ⁽²⁾ p₁₇ ⁽²⁾ p₁₁ ⁽³⁾ p₁₄ ⁽³⁾ p₁₇ ⁽³⁾ p₁₁ ⁽⁴⁾ p₁₄ ⁽⁴⁾ p₁₇ ⁽⁴⁾ p₁₅ ⁽²⁾ p₁₈ ⁽²⁾ p₁₂ ⁽³⁾ p₁₅ ⁽³⁾ p₁₈ ⁽³⁾ p₁₂ ⁽⁴⁾ p₁₅ ⁽⁴⁾ p₁₈ ⁽⁴⁾ . . . . . . . . . . . . . . . . . . . . . . . . . . . Seq #102 p₉₁₃ ⁽²⁾ p₉₁₆ ⁽²⁾ p₉₁₀ ⁽³⁾ p₉₁₃ ⁽³⁾ p₉₁₆ ⁽³⁾ p₉₁₀ ⁽⁴⁾ p₉₁₃ ⁽⁴⁾ p₉₁₆ ⁽⁴⁾ p₉₁₄ ⁽²⁾ p₉₁₇ ⁽²⁾ p₉₁₁ ⁽³⁾ p₉₁₄ ⁽³⁾ p₉₁₇ ⁽³⁾ p₉₁₁ ⁽⁴⁾ p₉₁₄ ⁽⁴⁾ p₉₁₇ ⁽⁴⁾ p₉₁₅ ⁽²⁾ p₉₁₈ ⁽²⁾ p₉₁₂ ⁽³⁾ p₉₁₅ ⁽³⁾ p₉₁₈ ⁽³⁾ p₉₁₂ ⁽⁴⁾ p₉₁₅ ⁽⁴⁾ p₉₁₈ ⁽⁴⁾ Seq #103 b₁₃ b₁₆ p₉₁₉ ⁽³⁾ p₉₂₂ ⁽³⁾ p₉₂₅ ⁽³⁾ p₉₁₉ ⁽⁴⁾ p₉₂₂ ⁽⁴⁾ p₉₂₅ ⁽⁴⁾ b₁₄ b₁₇ p₉₂₀ ⁽³⁾ p₉₂₃ ⁽³⁾ p₉₂₆ ⁽³⁾ p₉₂₀ ⁽⁴⁾ p₉₂₃ ⁽⁴⁾ p₉₂₆ ⁽⁴⁾ b₁₅ b₁₈ p₉₂₁ ⁽³⁾ p₉₂₄ ⁽³⁾ p₉₂₇ ⁽³⁾ p₉₂₁ ⁽⁴⁾ p₉₂₄ ⁽⁴⁾ p₉₂₇ ⁽⁴⁾ Seq #104 b₃₁ b₃₄ p₉₂₈ ⁽³⁾ p₉₃₁ ⁽³⁾ p₉₃₄ ⁽³⁾ p₉₂₈ ⁽⁴⁾ p₉₃₁ ⁽⁴⁾ p₉₃₄ ⁽⁴⁾ b₃₂ b₃₅ p₉₂₉ ⁽³⁾ p₉₃₂ ⁽³⁾ p₉₃₅ ⁽³⁾ p₉₂₉ ⁽⁴⁾ p₉₃₂ ⁽⁴⁾ p₉₃₅ ⁽⁴⁾ b₃₃ b₃₆ p₉₃₀ ⁽³⁾ p₉₃₃ ⁽³⁾ p₉₃₆ ⁽³⁾ p₉₃₀ ⁽⁴⁾ p₉₃₃ ⁽⁴⁾ p₉₃₆ ⁽⁴⁾ . . . . . . . . . . . . . . . . . . . . . . . . . . . Seq #154 b₉₃₁ b₉₃₄ p₁₃₇₈ ⁽³⁾ p₁₃₈₁ ⁽³⁾ p₁₃₈₄ ⁽³⁾ p₁₃₇₈ ⁽⁴⁾ p₁₃₈₁ ⁽⁴⁾ p₁₃₈₄ ⁽⁴⁾ b₉₃₂ b₉₃₅ p₁₃₇₉ ⁽³⁾ p₁₃₈₂ ⁽³⁾ p₁₃₈₅ ⁽³⁾ p₁₃₇₉ ⁽⁴⁾ p₁₃₈₂ ⁽⁴⁾ p₁₃₈₅ ⁽⁴⁾ b₉₃₃ b₉₃₆ p₁₃₈₀ ⁽³⁾ p₁₃₈₃ ⁽³⁾ p₁₃₈₆ ⁽³⁾ p₁₃₈₀ ⁽⁴⁾ p₁₃₈₃ ⁽⁴⁾ p₁₃₈₆ ⁽⁴⁾ Seq #155 b₉₄₉ b₉₅₂ b₇₃₀₉ b₇₃₁₂ b₇₃₁₅ b₇₃₁₈ b₇₃₂₁ b₇₃₂₄ b₉₅₀ b₉₅₃ b₇₃₁₀ b₇₃₁₃ b₇₃₁₆ b₇₃₁₉ b₇₃₂₂ b₇₃₂₅ b₉₅₁ b₉₅₄ b₇₃₁₁ b₇₃₁₄ b₇₃₁₇ b₇₃₂₀ b₇₃₂₃ b₇₃₂₆ Seq #156 b₉₆₇ b₉₇₀ b₇₃₂₇ b₇₃₃₀ b₇₃₃₃ b₇₃₃₆ b₇₃₃₉ b₇₃₄₂ b₉₆₈ b₉₇₁ b₇₃₂₈ b₇₃₃₁ b₇₃₃₄ b₇₃₃₇ b₇₃₄₀ b₇₃₄₃ b₉₆₉ b₉₇₂ b₇₃₂₉ b₇₃₃₂ b₇₃₃₅ b₇₃₃₈ b₇₃₄₁ b₇₃₄₄ . . . . . . . . . . . . . . . . . . . . . . . . . . . Seq #485 b₆₈₈₉ b₆₈₉₂ b₁₃₂₄₉ b₁₃₂₅₂ b₁₃₂₅₅ b₁₃₂₅₈ b₁₃₂₆₁ 0 b₆₈₉₀ b₆₈₉₃ b₁₃₂₅₀ b₁₃₂₅₃ b₁₃₂₅₆ b₁₃₂₅₉ b₁₃₂₆₂ b₁₃₂₆₄ b₆₈₉₁ b₆₈₉₄ b₁₃₂₅₁ b₁₃₂₅₄ b₁₃₂₅₇ b₁₃₂₆₀ b₁₃₂₆₃ b₁₃₂₆₅ . . . . . . . . . . . . . . . . . . . . . . . . . . . Seq #508 b₇₃₀₃ b₇₃₀₆ b₁₃₆₄₀ b₁₃₆₄₃ b₁₃₆₄₆ b₁₃₆₄₉ b₁₃₆₅₂ 0 b₇₃₀₄ b₇₃₀₇ b₁₃₆₄₁ b₁₃₆₄₄ b₁₃₆₄₇ b₁₃₆₅₀ b₁₃₆₅₃ b₁₃₆₅₅ b₇₃₀₅ b₇₃₀₈ b₁₃₆₄₂ b₁₃₆₄₅ b₁₃₆₄₈ b₁₃₆₅₁ b₁₃₆₅₄ b₁₃₆₅₆ Seq #509 b′₁₃ b′₁₆ b′₅₅ b′₅₈ b′₆₁ b′₆₄ 0 0 b′₁₄ b′₁₇ b′₅₆ b′₅₉ b′₆₂ b′₆₅ b′₆₇ 0 b′₁₅ b′₁₈ b′₅₇ b′₆₀ b′₆₃ b′₆₆ b′₆₈ 0 Seq #510 b′₃₁ b′₃₄ b′₆₉ b′₇₂ b′₇₅ b′₇₈ 0 0 b′₃₂ b′₃₅ b′₇₀ b′₇₃ b′₇₆ b′₇₉ b′₈₁ 0 b′₃₃ b′₃₆ b′₇₁ b′₇₄ b′₇₇ b′₈₀ b′₈₂ 0 Seq #511 b′₄₉ b′₅₂ b′₈₃ b′₈₆ b′₈₉ b′₉₂ 0 0 b′₅₀ b′₅₃ b′₈₄ b′₈₇ b′₉₀ b′₉₃ b′₉₅ 0 b′₅₁ b′₅₄ b′₈₅ b′₈₈ b′₉₁ b′₉₄ b′₉₆ 0 Example: Storing Texts into Peptide Sequences

Referring to FIG. 8, an illustration 800 of storing digital data into peptide sequences in accordance with embodiments of the disclosure is depicted. Performing step 402 of method 400, the 848 bits long text symbol for “The Hong Kong Polytechnic University, 80th anniversary.” in both Chinese and English and the motto of The Hong Kong Polytechnic University (PolyU) in Chinese, in BIG5 encoding, is encoded in a digital code having 40 lines of 16 triplets of bits. An error-correction method with LDPC code as described in method 600 is used at the encoding step 402. Performing step 602 of method 600, order-checking bits are added. The order-checking bits are generated to protect the order of the first and second symbols and the order of the first and second last symbols in a peptide sequence.

Performing step 604 of method 600, 3 LDPC codes are used to encode the 848 bits long text symbol and the order-checking bits to 40 lines of data, each line with 16 triplets of bits. The LDPC codes are designed with the aim to recover the raw digital data when any arbitrary 10% of peptides cannot be retrieved, in case of insufficient signals in MS/MS spectra.

Performing step 404 of method 400, the digital code are then translated into 40 18-mer peptide sequences using an independent and fixed bits-to-amino-acid mapping. As discussed in the present disclosure, amino acid in the peptide sequence can be digital data bearing or non-digital data bearing. The peptides in the example are of the format of F-[16 residues]-R, in which: (i) there are 18 amino acids in each peptide; (ii) the amino acids at the N-terminal and C-terminal of each peptide are known (F and R) and do not carry any information (non-digital data bearing), and only 16 amino acids are taken into account for each peptide in the coding scheme; and (iii) 8 different amino acids (S, T, E, Y, A, V, L, and F) are used for translating the digital code (000, 001, 010, 011, 100, 101, 110, and 111). Performing step 406 of method 400, the 40 translated peptide sequences are synthesized into peptide sequences by the synthesizer 112, mixed into a mixture of peptides, and stored in a suitable condition.

As described above, by adopting error-correction methods for encoding or by using non-digital data bearing amino acids for synthesis purpose, the amount of amino acids in the peptides that can carry digital data is reduced. It is desirable to have efficient error-correction methods that enable a minimal amount of redundancy but still can protect the integrity of the digital data stored in the peptide sequences. One or more amino acids in a peptide sequence can be used to represent the identity (e.g. the address and version) of the peptide, and one or more amino acids in a peptide sequence can be used for identifying errors and/or checking the integrity of the peptide.

In consideration of the various factors such as cost of synthesis, the amino acids are selected and length of the peptides is optimized to minimize the sequencing error while maximizing data storage. Shorter peptides are cheaper to synthesize and easier to be sequenced with reduced missed cleavage, but longer peptides can store more data per peptide, reduce the number of peptides required for analysis, and reduce the address and error correction overhead. In an embodiment, 8 natural amino acids are selected, and the length of peptide is 18 amino acids long. In alternative embodiments, the length of the peptide can be varied, the set of amino acids can be expanded by incorporating unnatural amino acids, and distinct functional groups, or affinity labels, together with enrichment strategy or selection strategy during MS/MS (such as precursor ion scan or neutral loss scan), can be incorporated to allow selective retrieval of specific peptides to increase signal-to-noise ratios.

For detection and identification purposes, peptides can be labelled. In one example, the label can be at the N- or C-terminal of the peptide. In yet another example, the label can be, but is not limited to, amino acids, affinity labels, solubilisation labels, chromatography labels, epitope labels, fluorescence labels, radioisotope labels, or combinations thereof. In yet another example, the label can be bromine or chlorine labelled amino acids attached to either N-terminal or C-terminal of peptides such that the digital data bearing peptides can be identified in MS spectra and the direction of peptides can be identified in MS/MS spectra. The bromine or chlorine may also be labelled to an unnatural amino acid. In yet another example, the label can be an isotope labelled molecule bound to the N-terminal or side-chain of the peptide, such that when the digital data bearing peptides are fragmented, the appearance of the specific peaks related to the labelled molecule on MS/MS spectra indicates the presence of digital data bearing peptides. In yet another example, the label can be non-digital data bearing amino acids.

In the present disclosure, the peptide sequence determines the physicochemical properties of the peptide, which can be critical to achieve optimal peptide structures to store digital data and to retrieve digital data by sequencing. In one example, the physicochemical property can be, but is not limited to, physical, chemical and molecular properties. In another example, the physicochemical property comprises, but is not limited to, hydrophobicity, solubility, charge, stability, 3-dimensional peptide structure, signal strength, mass, polarizability, freezing point, boiling point, melting point, infrared spectrum, viscosity, density or combinations thereof.

The physicochemical property of the peptide can be influenced by amino acids in the peptide, wherein properties such as, but not limited to, length, type, order, or any combinations thereof, of the amino acids can be critical to achieve an optimal peptide structure to store digital data. In one example, a peptide that is 18 amino acids in length is critical to achieve an optimal peptide structure to store digital data. In another example, a hydrophilic peptide, which includes more hydrophilic amino acids in the peptide sequence, is critical to achieve an optimal peptide structure to store digital data. As used herein, the term “hydrophilic amino acids” refers to amino acids having a hydrophilic side chain; such side chain may be uncharged, positively (cationic) or negatively charged (anionic) under normal physiological conditions, in particular at about pH 7.4. Uncharged hydrophilic amino acids can include, but are not limited to, asparagine and glutamine: positively charged hydrophilic amino acids can be, but are not limited to, arginine, histidine and lysine, and the unnaturally occurring amino acid omithine; negatively charged amino acids include aspartic acid and glutamic acid. In another example, a hydrophobic peptide, which includes more hydrophobic amino acids in the peptide sequence, is critical to achieve an optimal peptide structure to store digital data. “Hydrophobic amino acids” refers to naturally occurring amino acids having a hydrophobic and/or aromatic side chain, such as, but not limited to, alanine, valine, leucine, isoleucine, and the aromatic amino acids phenylalanine, tyrosine and tryptophan. Further included are unnaturally occurring amino acids such as, but not limited to, cyclohexylalanine. In yet another example, the amino acids at the N- or C-terminal of the peptide can affect the optimal peptide structure. In yet another example, the N-terminal of the peptide can be phenylalanine or the C-terminal of the peptide can be arginine.

Retrieving Digital Data from Peptide Sequences

Referring to FIG. 2, a schematic diagram of a system 200 configured to retrieve digital data from peptide sequences is depicted. The system 200 includes a sequencer 212 configured to sequence and determine an order of the peptide sequences, a processor 202 in communication with the sequencer 212, and a memory 204 including computer program code. The memory 204 is in communication with the processor 202 such that the processor 202 can read the computer program code stored in the memory 204. The processor 202 can then execute the computer program code to decode peptide sequences received from the sequencer 212 to digital data. The processor 202 receives the peptide sequences from the sequencer 212, which determines stored peptide sequences. These components can be integrated in one location or distributed among different locations, and the communications can be performed in real-time, in near-real-time, or in batches.

The sequencer 212 can include equipment/device such as, but not limited to, gel electrophoresis apparatus, high performance liquid chromatography (HPLC) machine, capillary electrophoresis apparatus, ionizer, and mass spectrometer. The sequencer 212 may be single equipment/device or a series of equipment/devices in combination configured to sequence and determine an order of the peptide sequences and/or separate peptide sequences from a mixture of peptides. Peptide sequencing is expected to be continuously performed for research purposes, as peptides are important for all living organisms. Consequently, equipment/devices and methods to retrieve digital data from digital data bearing peptides will be available. This can be advantageous over storage devices such as optical disks, in which case, once they became obsolete, it is very difficult to find the drives to retrieve data from these media, similar to the fate of obsolete Iomega Zip and floppy disks.

The system 200 can be used to implement method 500 for retrieving digital data from peptide sequences as depicted in FIG. 5. The processor 202 and the memory 204 including computer program code in the system 200 can be parts of a general purpose computing device as depicted in FIG. 3, in which the processor 202 corresponds to processor 302, and the memory 204 corresponds to memory 304. The processor 202 and the memory 204 in the system 200 can be the same as or different from the processor 102 and the memory 104 used in the system 100. The method 500 broadly includes:

step 502: sequencing and determining an order of the peptide sequences: step 504: converting the peptide sequences with the determined order into a digital code; and step 506: decoding the digital data from the digital code.

At step 502, the digital data bearing peptides are sequenced and an order of the peptide sequences is determined by the sequencer 212. The sequencing can be based on enzymatic digestion, mass spectrometry (MS), Edman Degradation, nanopore sequencing, or any combinations thereof. Sequencing comprises multiple steps including, but are not limited to, peptide separation, ionization, ion selection, fragmentation, sequencing, or any combinations thereof. In one example, individual peptides can be separated from a mixture of peptides using methods such as, but are not limited to, electrophoresis, liquid chromatography (LC), ion mobility, cationic exchange (SCX), high performance liquid chromatography (HPLC), ultrahigh pressure liquid chromatography (UPLC), nano-liquid chromatography or any combinations thereof. In yet another example, peptides can be sequenced using methods such as, but not limited to, mass spectrometry (MS), tandem mass spectrometry (MS/MS), matrix-assisted laser desorptionlionization (MALDI) spectrometry, Matrix-Assisted Laser Desorption/Ionization Time-of-Flight (MALDI-TOF) spectrometry, or any combinations thereof. In another example, peptides are converted to charged ions using ionization methods such as, but not limited to, electrospray ionization, matrix-assisted laser desorptionionization, surface-assisted laser desorption/ionization, atmospheric-pressure ionization, direct ionization, or any combinations thereof for mass spectrometry analysis. In yet another example, peptides that are ionized can undergo ion selection using methods such as, but are not limited to, data-independent-acquisition (DIA), data-dependent-acquisition (DDA), non-targeted, targeted, or any combinations thereof, for MS/MS analysis. In another example, peptides that are ionized can be fragmented based on methods such as, but are not limited to, collision-induced dissociation (CID), high-energy collisional dissociation (HCD), electron-capture dissociation (ECD), electron-transfer dissociation (ETD), or any combinations thereof to elucidate the amino acid sequences. The conditions of the sequencer 212 can optimized for separation, detection and sequencing of peptides in the mixtures. In an embodiment of the present disclosure, a LC-MS/MS protocol has been developed and successfully applied to analysis of a mixture containing 40 data-bearing 18-mer peptides, each with two fixed amino acids at the two ends.

Analysis of the peptide sequence can be accomplished by methods including, but not limited to, database search or de novo sequencing. “Database search” refers to a simple version wherein the mass spectral data of the unknown peptide is submitted and checked against the mass spectral data in the database to find a match with a known peptide sequence, with the drawback that database searching cannot identify novel proteins and modified proteins which are not contained in the database. For digital data storage, the peptides are used to carry random information bits with “0”s and “1”s. The peptides are therefore unnatural peptides and no database is available for searching and identifying these peptides. In contrast to database search method, de novo sequencing method expands the search space to all combinations of the amino acids.

“De novo sequencing” refers to the process of assigning fragment ions directly from a mass spectrum, wherein different parameters and algorithms can be selected and used for interpretation, without referring to established databases. As such, the determination of the peptide sequence requires a computational method that is able to utilize the readout generated by the sequencing step, for example from a mass spectrum, and to identify the order of the amino acids based on the sequencing method disclosed herein. A number of algorithms have been developed by use of the graph theory model together with the dynamic programming algorithms, including, but are not limited to, Lutefisk, Sherenga algorithm, PepNovo, MSNovo, pNovo, UniNovo, NovoHCD, and Novor.

A constraint for the dynamic algorithm is that no training spectra are provided for the sequencing of the digital data bearing peptides. Accordingly, de novo sequencing based on the graph model is utilized for determining the peptide sequences. In the graph model, the MS/MS spectrum is represented by a directed acyclic graph (DAG), called spectrum graph. The peaks of the spectrum can be taken as vertices, while an edge is added between two vertices when the mass gap between two peaks is equal to the mass of an amino acid. The objective of the dynamic programming is to find the longest path (or best path) in the graph starting from the head vertex to the tail vertex. An alternative approach to identify the sequence is to start with the middle part of the MS/MS spectrum. For example, the sequence tagging method first infers a partial sequence called tag, and then finds the whole sequence that can match the tag. In the tag-based method, the tags are first found from the MS/MS spectrum based on some scoring schemes. The inference of the sequence then relies on peptide comparison using the database search method or on extending the valid path of the tag in the middle position of the path using the de novo sequencing.

The peptide sequencing problem is outlined in Table 4, with knowledge of the information of the amino acids used, the spectrum S, the mass of the whole sequence, and the head and tail amino acids. The sequencing problem is to find the peptide P, whose theoretical spectrum T(P) best matches the experimental spectrum S. In some embodiments, it is assumed that the length N of the peptide sequence is fixed and known. Thus, the candidate peptides without length N are discarded. Two sequencing methods, namely two-stage sequencing method and highest-intensity-tag based sequencing method, are proposed. For both methods, the sequences are estimated in a manner that first infers a partial sequence with a small amount of reliable information and then finds the missing part of the sequence with less reliable data or the raw data. The purpose is to improve the speed of sequencing by generating fewer candidates. Moreover, due to the introduction of the tag, the highest-intensity-tag based sequencing method is more effective in rejecting the unlikely candidates.

TABLE 4 Description of the peptide sequencing problem. Peptide sequencing problem Input: set A of amino acids; mass set g for the amino acids in set A; experimental spectrum S; set (m/z) of mass/charge ratio of spectrum S; set I of intensity of spectrum S; length N of the peptide sequence; head and tail amino acids used for the peptide; mass M of the whole sequence. Output: Peptide P of length N. Problem: find peptide P, which most likely generates the experimental spectrum S.

Peptide Sequencing: Two-State Sequencing Method

FIG. 12 shows a flowchart illustrating a method 1200 of two-stage sequencing. Four steps are involved in the two-stage sequencing method 1200: (1) preprocessing, (2) candidate sequence generation, (3) sequence selection, and (4) candidate refining. As shown in FIG. 12, Steps 1-3 belong to the first stage (Stage 1), while Step 4 is processed in the second stage (Stage 2). In Stage 1 of the two-stage sequencing method 1200, partial sequence is inferred using the preprocessed data after Step 1. In Stage 2, the remaining part of the sequence is determined using the raw data.

At Step 1, preprocessing is performed. The goal of the preprocessing is twofold. Firstly, the goal is to remove some uninterpretable masses caused by noise and uncertainty. Secondly, the goal is to convert the mass/charge ratio set (m/z) to the corresponding mass sets m′_(b) and m′y. Given a set of mass/charge (m/h) ratios, these ratios are grouped into ρ subsets G₁, G₂, . . . , G_(p), where in each subset G_(i), i=1, 2, . . . , ρ, all (m/z) ratios are isotopes of a particular fragment, with a charge of value 1, 2, or 3 equaling the inverse of difference between consecutive (m/z) ratios in this subset. For each subset G_(i), a monoisotopic mass m′_(i) is calculated by m′_(i)=(m/z)_(i,0) z′_(i,0)−m_(H) z′_(i,0), i=1, 2, . . . , ρ, where (m/z)_(i,0) is the lowest value in this subset, and z′_(i,0) is the corresponding charge for (m/z)_(i,0). These m′_(i) values are then distributed among the mass sets m′_(b) and m′_(y). In some embodiments, one of the criteria of distribution is based on the intensities corresponding to the m′_(i) values. In some embodiments, one of the criteria of distribution is the isotopic pattern of the (m/z) ratios in G_(i). In some embodiments, one of the criteria of distribution is based on the fact that if m′_(i) is in m′_(b,i), then there is a corresponding m′_(j) in m′_(y,j), where m′j=M−m′_(i). In some embodiments, the distribution is determined real-time in Step 2 as described later in paragraphs [0114]-[0115]. In some embodiments of the preprocessing, only those with typical property of charges are reserved as the preprocessed data such that the preprocessed data may be more reliable than the raw data. However, in the event of the incomplete or ambiguous data (e.g., data lacking charge property), some useful mass values may be discarded in the preprocessing based on the abovementioned criteria. Hence, in the case when missing/uncertain elements of the sequence exist in Stage 1, the raw data may be considered in Stage 2.

At Step 2, the preprocessed data from step 1 is used to find the valid paths (sequences), and the number n of candidate sequences is counted. In FIG. 13, suppose that m_(Ngroup)=m_(H) and m_(cgroup)=m_(OH). The graph theory model is used to find the candidate paths (valid paths) which start with head mass m_(head) and end with mass M−m_(H)−m_(Cgroup)−m_(tail) in a directed acyclic graph (DAG). Since the masses obtained by mass/charge ratio set (m/z) are likely created by b-ion, y-ion, or both b-ion and y-ion. The mass set m′_(b,i), m′_(y,i) or both sets m′_(b,i) and m′_(y,i) can be considered in the path finding algorithm. In the graph model, the mass of the fragment ion can be represented by a vertex. If the mass gap between two fragment ions equals the mass of any amino acid, then an edge is added between these two vertices. As shown in FIG. 13, the tree can be expanded edge by edge. If the set of vertices is complete for the correct path, the sequencing problem can be reduced to finding the longest path in the graph. The path should include both the head and the tail vertices. Moreover, only those paths ending with mass M are taken as the candidates. For the example shown in FIG. 13, only Path 1 and Path 2 are the candidate paths.

Due to the imperfect fragmentation in MS/MS characterizations, two and three missing ions are often observed in a sequence. In the model disclosed herein, in order to ensure that the paths from the head can be extended to the tail, the number of missing amino acids is considered to be up to 4 in Stage 1. Starting from the mass with m_(b,1)=0, firstly, attempt is made to find the mass of the head amino acid, m_(b,2)=m_(head)+Δ₁. Next, the mass m_(b,i+1) is found by using the preprocessed data such that the mass gap between the current and the next vertices is approximate to mass s; or mass summation

$\sum\limits_{v = 1}^{i + l - 1}\; {s_{v}\left( {l \leq 4} \right)}$

of up to 4 amino acids with mass s_(v)∈g (v=1, 2, . . . , N), i.e., m_(b,i+1)=m_(b,i)+(s_(i)+Δ_(i)) for two consecutive vertices i and (i+1), or

$m_{b,{i + l}} = {m_{b,i} + \left( {{\sum\limits_{v = 1}^{i + l - 1}\; s_{v}} + \Delta_{i,{j + l}}} \right)}$

(where Δ_(j,i+1)∈[−lδ, +lδ] for a length-l tag from Vertex i to Vertex (i+l). As shown in FIG. 13, suppose that Path 2 is the correct path but with experimental masses, m_(b,1)=0, m_(b,i+1)=m_(b,i)+(m_(i)+Δ_(i)) for two consecutive vertices, or

$m_{b,{i + l}} = {m_{b,i} + {\sum\limits_{j = 1}^{i + l - 1}\; \left( {m_{i} + \Delta_{j}} \right)}}$

for a length-l tag. If Path 1 is the correct path with theoretical masses, then m_(b,i+1)=m_(b,i)+m_(i) with m_(b,1)=(m_(Ngroup)−m_(H)), m_(b,2)=(m_(Ngroup)−m_(H))+m_(head), . . . , m_(b,N)=M−m_(H)−m_(Cgroup)−m_(tail), m_(b,N+1)=M−m_(H)−m_(Cgroup), m_(b,N+2)=M. Referring to FIG. 13, if the mass gap between two vertices equals the mass of an amino acid, then a solid edge is added. On the other hand, if the mass gap equals the mass summation of two or more amino acids, then the dashed edges are added with hollow circles representing the missing vertices.

At Step 3, the effects of the following five factors are jointly considered when arriving at the score of a sequence candidate from Step 3.1 to Step 3.5: length of consecutive amino acids retrieved, number of amino acids retrieved, match error, average intensity of amino acids retrieved, and number of occurrences for different ion types with different offsets. The sequences with the longest length of consecutive amino acids retrieved are first selected (Step 3.1). Among the selected sequences, the sequences with the largest number of amino acids retrieved are then selected (Step 3.2). For the sequences with equal length of consecutive amino acids retrieved together with equal number of amino acids retrieved, the match error is evaluated, which is the mean square error between the observed mass values for the amino acids retrieved from the experimental spectrum and the actual mass values of the amino acids (Step 3.3). If there is more than one sequence with identical match errors, the average intensity of amino acids retrieved is further calculated and a higher score is given to a sequence with a larger average intensity value (Step 3.4). In addition, multiple ion types are usually considered as the important factors in inferring an amino acid, which means that a mass value may correspond to different types of ions in the spectrum. Generally, the more the number of occurrences for different ion-types of an amino acid is, the more likely the amino acid is correct. Therefore, for the sequences with equal score after the aforementioned evaluations of Steps 3.1-3.4, the number of occurrences for different ion-types is counted to determine the sequence (Step 3.5). The mass offset sets for the N-terminal a-ion, b-ion and c-ion type sets, i.e., {a, a-H₂O, a-NH₃, a-NH₃—H₂O}, {b, b-H₂O, b-H₂O—H₂O, b-NH₃, b-NH₃—H₂O}, and {c, c-H₂O, c-H₂O—H₂O, c-NH₃, c-NH₃—H₂O} are {−27, −45, −44, −62}, {+1, −17, −35, −16, −34}, and {+18, 0, −18, +1, −17}, respectively. The mass offset sets for the C-terminal x-ion and y-ion type sets can be calculated by shifting the masses of the c-ion and b-ion type sets by +27 and +18, respectively. According to the fragmentation method and the property of the data, all or some of the above ion types can be used flexibly.

Since the candidate sequences obtained at Step 2 are found by using the preprocessed data, which aim to provide more reliable information to generate the partial sequence, amino acid combinations (AACs) may present in the sequence due to insufficient data provided by preprocessing. At Step 4, if selected sequences with missing mass values exist, which means that the corresponding mass gaps are equal to the summation of at least two amino acids, the raw data may be used to find as many vertices as possible for the path in Stage 2. For the raw data, suppose that all (m/z) ratios have opportunity to be created by the singly, doubly or triply charged ions. Then the set with q mass/charge ratios (m/z)_(i) (i=1, 2, . . . , q) can be converted to the mass set m′_(b) of putative b-ion and the equivalent b-ion mass set m′_(y) of putative y-ion, each of sets m′_(b) and m′_(y) has 3q elements. Although the number of mass values increases, only the range between the head mass and the tail mass of the AAC is considered, which is relatively smaller when compared to that for the whole sequence. As shown in FIG. 13, a gap being the mass summation of 4 amino acids is shown in Path 1. With more information provided by the raw data, the following cases can be found for the gap: (a) composition of amino acid and AAC, (b) composition of two AACs, (c) composition of tag and AAC, and (d) one tag. Note that a gap being the mass summation of more amino acids is effective to ensure that the valid paths can be formed. However, more candidate sequences may be generated and thus longer time is required for the sequencing.

As shown in FIG. 12, after finding the missing amino acids of AACs at Step 4.1, the sequences with the longest length of consecutive amino acids retrieved in AACs are selected as candidate sequences (Step 4.2). If there still remain at least two candidate sequences after selection, a final decision is made based on the match error of the amino acids retrieved in AACs for each sequence (Step 4.3).

Peptide Sequencing: Highest-Intensity-Tag Based Sequencing Method

The mass/charge (m/z) ratio corresponding to the first or second highest intensity is first recognized to further infer the tag or the path. In highest-intensity-tag based sequencing method, short tags with three amino acids are used in the tag-based methods, such as GutenTag, DirecTag, and NovoHCD. Although tags with shorter length can avoid introducing the wrong amino acids, the number of candidate tags is relatively larger and sometimes it is hard to infer the sequences due to insufficient information provided by the tag. As disclosed herein, the length of the tag is not fixed and can be up to the length of the peptide if the data is complete, which helps to reduce the search space. When a tag contains wrong amino acids, usually, it cannot be extended with valid prefix and suffix parts. In this case, the length of the tag is shortened by adaptively reducing the number of the higher-intensity data points used for the tag-finding algorithm. In addition, the vertex with the highest intensity may not definitely present in the correct path due to the uncertainty of the data. When valid paths cannot be found, it may be possible to infer the tag with the second highest intensity.

FIG. 14 shows a flowchart illustrating a method 1400 of highest-intensity-tag based sequencing. The method 1400 commences at step 1402 for preprocessing of the raw data. Step 1402 is the same as step 1 of the two-stage sequencing method 1200. The method 1400 then proceeds from step 1402 to steps 1404, 1406, and 1408.

At steps 1404, 1406 and 1408, the intensities of the preprocessed data are sorted from the largest to the smallest and values with J denoting the ranking of intensity. The mass/charge ratio with the highest intensity is then identified and the mass/charge ratio is converted to the corresponding mass of a b-ion. As a start, it is set as J=1 and i=1, and using only W=w_(i) (N≥w₁>w₂> . . . >w_(V)) masses with the higher ranking in the tag-finding processing.

The method 1400 then proceeds to step 1410 to find the highest-intensity-based tag. Starting from the mass m′_(B,J) of the b-ion or m′_(Y,J) of the y-ion with the highest intensity, the highest-intensity-based tag is found by simultaneously connecting the vertices in the forward direction pointing to the tail vertex of the path, and connecting the vertices in the backward direction pointing to the head vertex of the path, where the vertices have mass gap being the mass g_(k) (k=1, 2, . . . , K) of any amino acid and preferably the length of the tag is as long as possible (see FIG. 15). The tags containing the amino acid with the highest intensity are obtained subsequently, which are called highest-intensity-based tags. With knowledge of the masses of the head and the tail amino acids of a highest-intensity-based tag, the method proceeds to step 1412 to find the prefixes that can connect the head of the path to the head of the tags in the forward direction by using the method described at Step 2 of the two-stage sequencing method 1200. For the tags with valid prefixes, at step 1414, the suffix parts of the sequences can be further found by linking the tail of the tags to the tail of the path in the forward direction using the similar method.

At step 1416, the candidate paths can be constructed by combining the three parts: prefix, tag, and suffix. At step 1418, one can follow Steps 3 and 4 of the two-stage sequencing method 1200 to select and refine the sequences. Note that a larger value for W sometimes introduces one or more wrong amino acids in the head and/or tail parts of a tag, while a smaller value for W may give more reliable tag but the length of the tag may be limited. Therefore, at steps 1422 and 1424, if no valid candidate can be found, one may attempt to reduce the value of W with W=w_(i) by increasing i by 1, i.e., i=i+1, and repeat the tag-prefix-suffix finding procedure until the candidate sequence can be found or i=V.

At steps 1432 and 1434, for the special case when the experimental mass with the highest intensity gives an unreliable message due to noise and uncertainty, a highest-intensity-based tag or a valid path with the highest-intensity-based tag cannot be found. In this case, the mass with the second highest intensity is used by setting J=2 and i=1 to find the second highest-intensity-based tag and the candidates.

The computational method for the rapid and correct assignment of peptide sequences from the large number of MS/MS spectra presented in this disclosure has the following features: (i) assigning the peptide sequences based on the length, amino acids and sequence format that are determined at step 502; (ii) following the general rules of fragmentation of peptide ions for the sequence assignment; (iii) distinguishing isotope labels, so that if such labels, e.g. chlorine or bromine, are incorporated in the peptides, the method could identify the isotopic pattern and assign the correct ion type; and (iv) assigning the gaps when some of the b or y ion peaks in the MS/MS spectra are of low abundances or missing. In an embodiment, the method implemented in a software is developed. The method gives scores to sequence candidates based on the following five factors: the length of consecutive amino acids retrieved, the number of amino acids retrieved, match error, intensity, and the number of occurrences for different ion types with difference offsets. The higher the score is, the more likely that the sequence is correct. The computational method implemented in the software can be further optimized for better and faster sequence assignment.

Sequence Grouping

Referring to the example in FIG. 8, a mixture of peptides are synthesized from 40 peptide sequences. In one embodiment, a set of 90 spectra is obtained for the 40 peptide sequences after MS/MS analysis, each with different mass M of the whole sequences. If the data is sufficient for estimating the peptide sequences, one or more candidate sequences for each spectrum can be obtained using the peptide sequencing methods 1200 and/or 1400. Moreover, there are about 2 spectra per peptide sequence on average after ignoring the failed spectra, which means that two or more candidate sequences may correspond to one address pair. Thus, it is necessary to further select only one sequence for each address pair, which can involve the steps of: (1) finding and selecting the sequences based on Steps 1-3. 4.1-4.3 of the two-stage sequencing method 1200; (2) checking the length of the candidate sequences and discarding those without length of (N−2); (3) for the remaining candidate sequences, checking the order of Symbols S₁ and S₂, and the order of Symbols S₁₅ and S₁₆ according to the first bits of Symbols S₃ and S₇, respectively; and (4) removing the duplicate candidate sequences in each spectrum.

As a result, a set of candidate sequences regardless of the generating spectra can be obtained. The candidate sequences are then grouped according to 40 address pairs {A_(i,1), A_(i,2))}, i=1, 2, . . . , 40. For each group, there are following cases possible:

Case 1: There is only one sequence. Case 2: There are two or more sequences, some of which are the same, where:

-   -   2a. there is only one result with two or more sequences; or     -   2b. there are at least two different results, each with two or         more sequences.         Case 3: All sequences in the group are different, where:     -   3a. different sequences belong to the same spectrum; or     -   3b. different sequences belong to two spectra; or     -   3c. different sequences belong to more than two spectra.

For Case 1, the only sequence can be assigned for the group. For Case 2a, the result with two or more sequences is selected. For Case 2b, the results with two or more sequences can be selected as candidate sequences. Among the candidate sequences, the sequence with the highest score according to Steps 3.1-3.5, 4.2, and 4.3 of method 1200 can be further selected. For Case 3a, the sequence with the highest score according to Steps 4.2 and 4.3 of method 1200 can be selected. For Case 3b, the sequences obtained by Steps 3.1, 3.2, and 4.1 of method 1200 are examined for duplicate sequences. If there are duplicate sequences, the output is the result with duplicate sequences. If not, the sequence with the highest score according to Steps 3.1-3.5, 4.2, and 4.3 of method 1200 is selected. For Case 3c, the sequence with the highest score according to Steps 3.1-3.5, 4.2, and 4.3 of method 1200 is selected. To reduce the number of candidates more efficiently, it is possible to first find the groups belonging to Cases 1 and 2 and record the spectra of sequences in these groups. Subsequently, find the sequences created by these spectra but presented in other groups, and mark them as the presented sequences. For Case 3, the presented sequences in the grouping can be discarded.

Upon performing peptide sequencing and/or sequence grouping using the computational methods described above, at step 504 of the method 500, the obtained peptide sequences with the determined order can be converted into a digital code by the processor 202. The peptide sequences with the determined order are obtained by sequencing the peptides or the mixture of peptides at step 502. The methods for converting the peptide sequences into the digital code should correspond to the methods for translating the digital code into peptide sequences in the data storage process (step 404 of method 400). In embodiments of the present disclosure, each peptide sequence is formed by amino acids. One or more amino acids are used to represent a bit pattern or symbol pattern in the data storage process. Therefore, in order to convert the peptide sequence into a digital code, one or more amino acids in the peptide sequence are represented by the corresponding bit pattern or symbol pattern. For example, when one symbol in a digital code is mapped to three amino acids to form a peptide sequence at step 404, three amino acids in the peptide sequence shall be reversely mapped to the one symbol to convert the peptide sequences into the digital code at step 504.

At step 506, the digital data can be decoded from the digital code by the processor 202. When error-correction method is used for encoding the digital data, one or more error-correction technique(s) is/are applied to recover the starting digital code. In an example, when a LDPC code is used for encoding the digital data into a digital code, the converted digital code obtained from step 504 is decoded based on LDPC code. The converted digital code contains estimated information bits and estimated parity bits. The estimated parity bits are used to detect and correct errors in the estimated information bits. The correct information bits can therefore be retrieved from the converted digital code. In another example, when order-checking bits are used for encoding the digital data into a digital code, the converted digital code obtained from step 504 is decoded based on the pre-defined rules of generating the order-checking bits. The converted digital code contains redundancy of order-checking bits. The order-checking bits are used to check if certain bit(s)/symbol(s) are in the right order, therefore correcting the wrong orders of bit(s)/symbol(s) to retrieve the correct digital data from the converted digital code. Decoding the digital data from the digital code can use algorithms such as belief-propagation algorithm, message-passing algorithm, sum-product algorithm and bit-flipping algorithm.

In the case when the digital data is encrypted or ciphered before being stored, one or more decryption technique(s) is/are applied to the reverse-mapped bits/symbols to recover the original digital data. In the case when the digital data and/or the encrypted data and/or the encoded digital code are interleaved before being stored, one or more deinterleaved technique(s) is/are applied to the reverse-mapped bits/symbols to recover the original digital data.

FIG. 7 shows a flowchart illustrating a method 700 for decoding digital data from a digital code used at step 506. The digital code includes order-checking bits and one or more LDPC codes. After performing step 502 and 504, the system 200 obtains a digital code converted from an order of estimated peptide sequences. At step 702, the system 200 creates a n×16 block of symbols based on the estimated sequences. In some embodiments, the converted digital code contains bit(s)/symbol(s) that indicate the addresses or positions of the estimated peptide sequences in the block of symbols. The information relating to the addresses or positions of the estimated peptide sequences is used to arrange the estimated peptide sequences in a right order in the block of symbols. The 16 symbols in each sequence are denoted as S₁, S₂, . . . , S₁₆. At step 704, according to the orders of the estimated symbol pairs {S₁, S₂} and {S₁₅, S₁₆}, the order-checking bits are generated based on pre-defined rules. At step 706, the order-checking bits are compared against the corresponding first bits of the estimated symbols S₃ and S₇ to see if they are identical. As an example, if there is no error in the orders of S₁ and S₂, the generated order-checking bit for {S₁, S₂} should match the first bit of the estimated symbol S₃. If the generated order-checking bits do not match the first bit of S₃ and/or S₇ in an estimated sequence, the estimated sequence in the block should be erased.

On the condition that the generated order-checking bits match the first bits of the estimated symbols S₃ and S₇, method 700 proceeds from step 706 to step 708. At step 708, the bits in the estimated symbols S₃-S₁₆ of the block are passed to the decoders of the LDPC codes to perform decoding of LDPC code. At step 710, the system 200 outputs a 40×16 block of symbols using the decoded bits of the LDPC codes. Similarly to step 704, order-checking bits are generated based on pre-defined rules at step 712 according to the decoded symbols pairs {S₁, S₂} and {S₁₅, S₁₆}. At step 714, the order-checking bits are compared against the corresponding first bits of the decoded symbol S₃ and S₇ to see if they are identical. If not, the system 200 reports a detected error and indicates that the decoding fails. If yes, the system 200 outputs the decoded sequences.

Example: Retrieving Digital Data from Peptide Sequences

Referring to FIGS. 9A and 9B, illustrations 900 and 950 of retrieving digital data from peptide sequences in accordance with embodiments of the disclosure is depicted. Performing step 502 of method 500, the stored mixture is first analyzed by LC-MS/MS. A 15 cm C18 column is used for ultrahigh pressure liquid chromatography (UPLC) separation, with the elution gradient changed from 95% solution A (0.2% formic acid in water) to 99% solution B (0.2% formic acid in acetonitrile). The MS analysis is performed on an orbitrap mass spectrometer coupled with the UPLC. A non-target strategy with m/z limits of 700-1500 and peptide isotopic pattern recognition are used to select ions for MS/MS analysis. High-energy collisional dissociation (HCD) and electron-capture dissociation (ECD) are performed in parallel to produce MS/MS spectra. A total of 90 spectra are produced.

In one embodiment (FIG. 9A), when two-stage sequencing method 1200 is used, among 90 spectra, there are 6 spectra without output sequences and another 6 spectra without length of 16, which are discarded in the sequence grouping. The sequences have length of 16 because the head and tail amino acids are excluded for simplicity. Excluding duplicate sequences, there are 43 distinct sequences with length of 16. After grouping based on the scores, 40 sequences are obtained corresponding to 40 groups with address pairs of {000 000}, {000 001}, {000 010}, . . . , {100 110}, {100 111}. Performing step 504 of method 500, these peptide sequences are converted into a digital code or equivalent symbols. The reverse-mapping method used is amino-acid-to-bits reverse mapping, in which an amino acid is reversely mapped to a triplet of bits. Because the amino acid F at the N-terminal and the amino acid R at the C-terminal do not carry any information, only the 16 amino acids in the 18-mer peptide sequences are converted to digital code or equivalent symbols. The digital code is decoded by performing step 506 of method 500 and method 700. In method 700, the order of the first two amino acids and the order of the last two amino acids are checked using the first bits of S₃ and S₇, respectively, in accordance with the encoding rules of the order-checking bits. If the bits generated according to the order-checking rules using the first two amino acids and the last two amino acids do not match the first bits of S₃ or S₇ respectively, then the corresponding sequence will be erased. Finally, a 40×16 block of symbols can be constructed. The error-correction method confirms the correct sequence assignment of 38 peptides, corrected 2 peptides, and excluded 3 impurity peptides. These corrected codes are further decoded to original data, with 100% retrieval. The data density of peptides for data storage in this preliminary study is ˜10 ¹⁰ bits/g, estimated from the injection volume of 3 L and peptide concentration of about 1 M.

In another embodiment (FIG. 9B), the highest-intensity-tag based sequencing method 1400 is used. Among the 90 spectra, 9 spectra cannot produce any valid sequence, 4 spectra produce valid sequences of length not equal to 16, and the remaining 77 spectra produce a total of 89 valid sequences. Thus, some of the groups have multiple sequences generated by the same or different spectra. Excluding duplicate sequences, there are 49 distinct sequences with length of 16. The sequence grouping method described in paragraphs [0126]-[0128] is used to obtain 40 groups, each with only one sequence. Step 506 of method 500 is performed to decode. Performing method 700 or step 702 of method 700, the correctness of all 40 sequences are confirmed, showing that all sequences in the group are correct even without performing order-checking and error-correction processes of steps 704-714, leading to 100% retrieval of the original data.

The data density may be further improved significantly since MS/MS sequencing of peptides with much smaller amounts, e.g., sub-attomole, could be achieved. At this detection limit, it is estimated at least 10¹⁸ bits/g could be achieved with the same setup.

FIG. 3 depicts an exemplary computing device 300, hereinafter interchangeably referred to as a computer system 300, where one or more such computing devices 300 may be used to execute the methods 400, 500, 600 and 700 of FIGS. 4, 5, 6 and 7. One or more components of the exemplary computing device 300 can also be used to implement the systems 100, 200 as well as the synthesizer 112 and the sequencer 212. The following description of the computing device 300 is provided by way of example only and is not intended to be limiting.

As shown in FIG. 3, the example computing device 300 includes a processor 302 for executing software routines. Although a single processor is shown for the sake of clarity, the computing device 300 may also include a multi-processor system. The processor 302 is connected to a communication infrastructure 306 for communication with other components of the computing device 300. The communication infrastructure 306 may include, for example, a communications bus, cross-bar, or network.

The computing device 300 further includes a main memory 304, such as a random access memory (RAM), and a secondary memory 310. The secondary memory 310 may include, for example, a storage drive 312, which may be a hard disk drive, a solid state drive or a hybrid drive and/or a removable storage drive 314, which may include a magnetic tape drive, an optical disk drive, a solid state storage drive (such as a USB flash drive, a flash memory device, a solid state drive or a memory card), or the like. The removable storage drive 314 reads from and/or writes to a removable storage medium 318 in a well-known manner. The removable storage medium 318 may include magnetic tape, optical disk, non-volatile memory storage medium, or the like, which is read by and written to by removable storage drive 314. As will be appreciated by persons skilled in the relevant art(s), the removable storage medium 318 includes a computer readable storage medium having stored therein computer executable program code instructions and/or data.

In an alternative implementation, the secondary memory 310 may additionally or alternatively include other similar means for allowing computer programs or other instructions to be loaded into the computing device 300. Such means can include, for example, a removable storage unit 322 and an interface 320. Examples of a removable storage unit 322 and interface 320 include a program cartridge and cartridge interface (such as that found in video game console devices), a removable memory chip (such as an EPROM or PROM) and associated socket, a removable solid state storage drive (such as a USB flash drive, a flash memory device, a solid state drive or a memory card), and other removable storage units 322 and interfaces 320 which allow software and data to be transferred from the removable storage unit 322 to the computer system 300.

The computing device 300 also includes at least one communication interface 324. The communication interface 324 allows software and data to be transferred between computing device 300 and external devices via a communication path 326. In various embodiments of the disclosure, the communication interface 324 permits data to be transferred between the computing device 300 and a data communication network, such as a public data or private data communication network. The communication interface 324 may be used to exchange data between different computing devices 300 which such computing devices 300 form part an interconnected computer network. Examples of a communication interface 324 can include a modem, a network interface (such as an Ethernet card), a communication port (such as a serial, parallel, printer, GPIB, IEEE 1394, RJ45, USB), an antenna with associated circuitry and the like. The communication interface 324 may be wired or may be wireless. Software and data transferred via the communication interface 324 are in the form of signals which can be electronic, electromagnetic, optical or other signals capable of being received by communication interface 324. These signals are provided to the communication interface via the communication path 326.

As used herein, the term “computer program product” may refer, in part, to removable storage medium 318, removable storage unit 322, a hard disk installed in storage drive 312, or a carrier wave carrying software over communication path 326 (wireless link or cable) to communication interface 324. Computer readable storage media refers to any non-transitory, non-volatile tangible storage medium that provides recorded instructions and/or data to the computing device 300 for execution and/or processing. Examples of such storage media include magnetic tape, CD-ROM, DVD, Blu-Ray™ Disc, a hard disk drive, a ROM or integrated circuit, a solid state storage drive (such as a USB flash drive, a flash memory device, a solid state drive or a memory card), a hybrid drive, a magneto-optical disk, or a computer readable card such as a PCMCIA card and the like, whether or not such devices are internal or external of the computing device 300. Examples of transitory or non-tangible computer readable transmission media that may also participate in the provision of software, application programs, instructions and/or data to the computing device 300 include radio or infra-red transmission channels as well as a network connection to another computer or networked device, and the Internet or Intranets including e-mail transmissions and information recorded on Websites and the like.

The computer programs (also called computer program code) are stored in main memory 304 and/or secondary memory 310. Computer programs can also be received via the communication interface 324. Such computer programs, when executed, enable the computing device 300 to perform one or more features of embodiments discussed herein. In various embodiments, the computer programs, when executed, enable the processor 302 to perform features of the above-described embodiments. Accordingly, such computer programs represent controllers of the computer system 300.

Software may be stored in a computer program product and loaded into the computing device 300 using the removable storage drive 314, the storage drive 312, or the interface 320. The computer program product may be a non-transitory computer readable medium. Alternatively, the computer program product may be downloaded to the computer system 300 over the communication path 326. The software, when executed by the processor 302, causes the computing device 300 to perform the necessary operations to execute the methods 400, 500, 600, and 700 as shown in FIGS. 4, 5, 6 and 7.

It is to be understood that the embodiment of FIG. 3 is presented merely by way of example to explain the operation and structure of the system 300. Therefore, in some embodiments one or more features of the computing device 300 may be omitted. Also, in some embodiments, one or more features of the computing device 300 may be combined together. Additionally, in some embodiments, one or more features of the computing device 300 may be split into one or more component parts.

It will be appreciated that the elements illustrated in FIG. 3 function to provide means for performing the various functions and operations of the system as described in the above embodiments.

When the computing device 300 is configured to realize the system 100 to store digital data into peptide sequences, the system 100 will have a non-transitory computer readable medium having stored thereon an application which when executed causes the system 100 to perform steps comprising: (i) encoding digital data into a digital code; (ii) translating the digital code into peptide sequences; and (iii) synthesizing the translated peptide sequences. When the computing device 300 is configured to realize the system 200 to retrieve digital data from peptide sequences, the system 200 will have a non-transitory computer readable medium having stored thereon an application which when executed causes the system 200 to perform steps comprising: (i) sequencing and determining an order of the peptide sequences; (ii) converting the peptide sequences with the determined order into a digital code; and (iii) decoding the digital data from the digital code.

It will be appreciated by a person skilled in the art that numerous variations and/or modifications may be made to the present disclosure as shown in the specific embodiments without departing from the spirit or scope of the disclosure as broadly described. The present embodiments are, therefore, to be considered in all respects to be illustrative and not restrictive. 

1. A method of storing digital data into peptide sequences.
 2. The method of claim 1, wherein the storing digital data into peptide sequences comprises: encoding the digital data into a digital code; translating the digital code into the peptide sequences; and synthesizing the translated peptide sequences.
 3. The method of claim 2; wherein the translating of the digital code into peptide sequences comprises: mapping a bit pattern or a symbol pattern into one or more amino acids such that the digital code is represented by a sequence of amino acids in the peptide sequences.
 4. The method of claim 2, the method further comprising forming a mixture of peptides based on the translated peptide sequences.
 5. The method of claim 2, the method further comprising adding one or more order-checking bits into the digital code, wherein the one or more order-checking bits are related to the order of the bits or symbols in the digital code.
 6. The method of claim 2, the method further comprising adding one or more error-correction codes into the digital code, wherein the one or more error-correction codes comprise any one or combination of repetition code, convolutional code, turbo code, fountain code, low-density parity-check (LDPC) code, Reed-Solomon (RS) code, Hadamard code, and Hamming code.
 7. The method of claim 6, wherein the one or more error-correction codes are generated based on the digital code, or both the digital code and order-checking bits added into the digital code.
 8. The method of claim 1, wherein the peptide sequences comprise distinct functional groups, isotope labels or affinity labels.
 9. The method of claim 1, wherein the peptide sequences comprise digital data bearing amino acids and non-digital data bearing amino acids.
 10. A method of retrieving digital data from peptide sequences.
 11. The method of claim 10, wherein the retrieving digital data from peptide sequences comprises: sequencing and determining an order of the peptide sequences; converting the peptide sequences with the determined order into a digital code; and decoding the digital data from the digital code.
 12. The method of claim 11, wherein the converting of the peptide sequences with the determined order into the digital code comprises: mapping one or more amino acids in the peptide sequences into a bit pattern or a symbol pattern such that the digital code is obtained from a sequence of amino acids in the peptide sequences with the determined order.
 13. The method of claim 11, the method further comprising separating peptide sequences from a mixture of peptides.
 14. The method of claim 11, wherein the digital code comprises one or more order-checking bits, wherein the one or more order-checking bits are related to the order of the bits or symbols in the digital code.
 15. The method of claim 11, wherein the digital code comprises one or more error-correction codes, wherein the one or more error-correction codes comprise any one or combination of repetition code, convolutional code, turbo code, fountain code, LDPC code, RS code, Hadamard code, and Hamming code.
 16. The method of claim 15, wherein decoding the digital data from digital code uses algorithms comprising belief-propagation algorithm, message-passing algorithm, sum-product algorithm, and bit-flipping algorithm.
 17. The method of claim 14, the method further comprising: encoding the orders of one or more bits or symbols in the digital code; comparing the order-checking bits with the encoded orders of the one or more bits or symbols in the digital code; and indicating a detected error if the order-checking bits do not match the encoded orders of the one or more bits or symbols in the digital code.
 18. A system for storing digital data into peptide sequences, the system comprising: a synthesizer configured to synthesize peptide sequences; at least one processor in communication with the synthesizer; and at least one memory including computer program code, the at least one memory and the computer program code configured to, with the at least one processor, cause the system at least to: encode the digital data into a digital code; translate the digital code into peptide sequences; and synthesize the translated peptide sequences using the synthesizer.
 19. The system of claim 18, wherein the system is caused to translate the digital code into peptide sequences, the at least one memory and the computer program code configured to, with the at least one processor, cause the system at least to: map a bit pattern or a symbol pattern of the digital code into one or more amino acids such that the digital code is represented by a sequence of amino acids in the peptide sequences.
 20. The system of claim 18, wherein the synthesizer is further configured to: form a mixture of peptides based on the translated peptide sequences.
 21. The system of claim 18, wherein the at least one memory and the computer program code configured to, with the at least one processor, cause the system further to: add one or more order-checking bits into the digital code, wherein the one or more order-checking bits are related to the order of the bits or symbols in the digital code.
 22. The system of claim 18, wherein the at least one memory and the computer program code configured to, with the at least one processor, cause the system further to: add one or more error-correction codes into the digital code, wherein the one or more error-correction codes comprise any one or combination of repetition code, convolutional code, turbo code, fountain code, LDPC code, RS code, Hadamard code, and Hamming code.
 23. The system of claim 22, wherein the one or more error-correction codes are generated based on the digital code, or both the digital code and order-checking bits added into the digital code.
 24. The system of claim 18, wherein the peptide sequences comprise distinctfunctional groups, isotope labels or affinity labels.
 25. The system of claim 18, wherein the peptide sequences comprise digital data bearing amino acids and non-digital data bearing amino acids.
 26. A system for retrieving digital data from peptide sequences, the system comprising: a sequencer configured to sequence and determine an order of the peptide sequences; at least one processor in communication with the sequencer; and at least one memory including computer program code, the at least one memory and the computer program code configured to, with the at least one processor, cause the system at least to: sequence and determine the order of the peptide sequences using the sequencer; convert the peptide sequences with the determined order into a digital code; and decode the digital data from the digital code.
 27. The system of claim 26, wherein the system is caused to convert the peptide sequences with the determined order into a digital code, the at least one memory and the computer program code configured to, with the at least one processor, cause the system at least to: map one or more amino acids in the peptide sequences into a bit pattern or a symbol pattern such that the digital code is obtained from a sequence of amino acids in the peptide sequences with the determined order.
 28. The system of claim 26, wherein the sequencer is further configured to: separate peptide sequences from a mixture of peptides.
 29. The system of claim 26, wherein the digital code comprises one or more order-checking bits, wherein the one or more order-checking bits are related to the order of the bits or symbols in the digital code.
 30. The system of claim 26, wherein the digital code comprises one or more error-correction codes, wherein the one or more error-correction codes comprise any one or combination of repetition code, convolutional code, turbo code, fountain code, LDPC code, RS code, Hadamard code, and Hamming code.
 31. The system of claim 30, wherein decoding the digital data from digital code uses algorithms comprising belief-propagation algorithm, message-passing algorithm, sum-product algorithm, and bit-flipping algorithm.
 32. The system of claim 29, wherein the at least one memory and the computer program code configured to, with the at least one processor, cause the system further to: encode the orders of one or more bits or symbols in the digital code; compare the order-checking bits with the encoded orders of the one or more bits or symbols in the digital code; and indicate a detected error if the order-checking bits do not match the encoded orders of the one or more bits or symbols in the digital code.
 33. A computational method for assigning peptide sequences, wherein the method comprises an algorithm that recognizes and scores one or more features.
 34. The computational method of claim 33, wherein the one or more of the features comprises: length of consecutive amino acids retrieved; isotope labels; number of amino acids retrieved; match error; intensity; and number of occurrences for different ion types with different offsets. 